ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 1309.6827
  4. Cited By
Optimization With Parity Constraints: From Binary Codes to Discrete
  Integration

Optimization With Parity Constraints: From Binary Codes to Discrete Integration

26 September 2013
Stefano Ermon
Carla P. Gomes
Ashish Sabharwal
B. Selman
ArXiv (abs)PDFHTML

Papers citing "Optimization With Parity Constraints: From Binary Codes to Discrete Integration"

14 / 14 papers shown
Title
Partition Function Estimation: A Quantitative Study
Partition Function Estimation: A Quantitative Study
Durgesh Kumar Agrawal
Yash Pote
Kuldeep S. Meel
71
11
0
24 May 2021
Taming Discrete Integration via the Boon of Dimensionality
Taming Discrete Integration via the Boon of Dimensionality
Jeffrey M. Dudek
Dror Fried
Kuldeep S. Meel
57
4
0
21 Oct 2020
Sparse Hashing for Scalable Approximate Model Counting: Theory and
  Practice
Sparse Hashing for Scalable Approximate Model Counting: Theory and Practice
Kuldeep S. Meel
S. Akshay
35
27
0
30 Apr 2020
Quantitative Verification of Neural Networks And its Security
  Applications
Quantitative Verification of Neural Networks And its Security Applications
Teodora Baluta
Shiqi Shen
Shweta Shinde
Kuldeep S. Meel
P. Saxena
AAML
89
105
0
25 Jun 2019
Empirical Bounds on Linear Regions of Deep Rectifier Networks
Empirical Bounds on Linear Regions of Deep Rectifier Networks
Thiago Serra
Srikumar Ramalingam
74
42
0
08 Oct 2018
High Dimensional Discrete Integration over the Hypergrid
High Dimensional Discrete Integration over the Hypergrid
R. Maity
A. Mazumdar
S. Pal
21
1
0
29 Jun 2018
Constrained Counting and Sampling: Bridging the Gap between Theory and
  Practice
Constrained Counting and Sampling: Bridging the Gap between Theory and Practice
Kuldeep S. Meel
31
23
0
06 Jun 2018
Approximate Inference via Weighted Rademacher Complexity
Approximate Inference via Weighted Rademacher Complexity
Jonathan Kuck
Ashish Sabharwal
Stefano Ermon
60
7
0
27 Jan 2018
Solving Marginal MAP Problems with NP Oracles and Parity Constraints
Solving Marginal MAP Problems with NP Oracles and Parity Constraints
Yexiang Xue
Zhiyuan Li
Stefano Ermon
Carla P. Gomes
B. Selman
63
16
0
08 Oct 2016
High Dimensional Inference with Random Maximum A-Posteriori
  Perturbations
High Dimensional Inference with Random Maximum A-Posteriori Perturbations
Tamir Hazan
Francesco Orabona
Anand D. Sarwate
Subhransu Maji
Tommi Jaakkola
75
7
0
10 Feb 2016
Constrained Sampling and Counting: Universal Hashing Meets SAT Solving
Constrained Sampling and Counting: Universal Hashing Meets SAT Solving
Kuldeep S. Meel
Moshe Y. Vardi
Supratik Chakraborty
Daniel J. Fremont
Sanjit A. Seshia
Dror Fried
A. Ivrii
S. Malik
90
78
0
21 Dec 2015
Tight Variational Bounds via Random Projections and I-Projections
Tight Variational Bounds via Random Projections and I-Projections
L. Hsu
Tudor Achim
Stefano Ermon
56
4
0
05 Oct 2015
Message Passing and Combinatorial Optimization
Message Passing and Combinatorial Optimization
Siamak Ravanbakhsh
89
1
0
20 Aug 2015
Distribution-Aware Sampling and Weighted Model Counting for SAT
Distribution-Aware Sampling and Weighted Model Counting for SAT
Supratik Chakraborty
Daniel J. Fremont
Kuldeep S. Meel
Sanjit A. Seshia
Moshe Y. Vardi
95
158
0
11 Apr 2014
1