# Closing the Gap Between Short and Long XORs for Model Counting

@inproceedings{Zhao2015ClosingTG, title={Closing the Gap Between Short and Long XORs for Model Counting}, author={Shengjia Zhao and Sorathan Chaturapruek and Ashish Sabharwal and Stefano Ermon}, booktitle={AAAI}, year={2015} }

Many recent algorithms for approximate model counting are based on a reduction to combinatorial searches over random subsets of the space defined by parity or XOR constraints. Long parity constraints (involving many variables) provide strong theoretical guarantees but are computationally difficult. Short parity constraints are easier to solve but have weaker statistical properties. It is currently not known how long these parity constraints need to be. We close the gap by providing matching… CONTINUE READING

#### Citations

##### Publications citing this paper.

SHOWING 1-10 OF 12 CITATIONS

## Approximate Inference via Weighted Rademacher Complexity

VIEW 6 EXCERPTS

CITES BACKGROUND, RESULTS & METHODS

## Our approach most closely resembles a recent line of work involving the Gumbel distribution ( Hazan and Jaakkola 2012

VIEW 6 EXCERPTS

CITES BACKGROUND, RESULTS & METHODS

## Model counting with error-correcting codes

VIEW 5 EXCERPTS

CITES METHODS & BACKGROUND

HIGHLY INFLUENCED

## Adaptive Hashing for Model Counting

VIEW 1 EXCERPT

CITES BACKGROUND

## BIRD: Engineering an Efficient CNF-XOR SAT Solver and Its Applications to Approximate Model Counting

VIEW 3 EXCERPTS

CITES BACKGROUND

## Constrained Counting and Sampling: Bridging the Gap between Theory and Practice

VIEW 3 EXCERPTS

CITES BACKGROUND & METHODS

## Fast and Flexible Probabilistic Model Counting

VIEW 2 EXCERPTS

CITES RESULTS & BACKGROUND

## Streamlining Variational Inference for Constraint Satisfaction Problems

VIEW 1 EXCERPT

CITES BACKGROUND

#### References

##### Publications referenced by this paper.

SHOWING 1-10 OF 39 REFERENCES

## A Scalable Approximate Model Counter

VIEW 10 EXCERPTS

HIGHLY INFLUENTIAL

## A Scalable and Nearly Uniform Generator of SAT Witnesses

VIEW 10 EXCERPTS

HIGHLY INFLUENTIAL

## On computing minimal independent support and its applications to sampling and counting

VIEW 5 EXCERPTS

HIGHLY INFLUENTIAL

## Stochastic Integration via Error-Correcting Codes

VIEW 8 EXCERPTS

HIGHLY INFLUENTIAL

## Extending SAT Solvers to Cryptographic Problems

VIEW 1 EXCERPT

HIGHLY INFLUENTIAL

## The exponential complexity of satisfiability problems

VIEW 2 EXCERPTS

HIGHLY INFLUENTIAL

## Exact Tests for Two-Way Contingency Tables with Structural Zeros

VIEW 3 EXCERPTS

HIGHLY INFLUENTIAL

## Conditional Inference on Tables With Structural Zeros

VIEW 3 EXCERPTS

HIGHLY INFLUENTIAL