Skip to search formSkip to main content

You are currently offline. Some features of the site may not work correctly.

Semantic Scholar uses AI to extract papers important to this topic.

2020

2020

We provide a graphical treatment of SAT and \#SAT on equal footing. Instances of \#SAT can be represented as tensor networks in a… Expand

Is this relevant?

2015

2015

We look at dynamic programming algorithms for propositional model counting, also called #SAT, and MaxSAT. Tools from graph… Expand

Is this relevant?

2014

2014

We revisit the gate elimination method, generalize it to prove correlation bounds of boolean circuits with Parity, and also… Expand

Is this relevant?

2013

2013

We provide a parameterized algorithm for the propositional model counting problem #SAT, the runtime of which has a single… Expand

Is this relevant?

2013

2013

We show that #SAT is polynomial-time tractable for classes of CNF formulas whose incidence graphs have bounded symmetric clique… Expand

Is this relevant?

Highly Cited

2010

Highly Cited

2010

We present algorithms for the propositional model counting problem #SAT. The algorithms utilize tree decompositions of certain… Expand

Is this relevant?

Highly Cited

2009

Highly Cited

2009

The channel capacity of a program is a quantitative measure of the amount of control that the inputs to a program have over its… Expand

Is this relevant?

2004

2004

It is known (Boppana et a;., 1987) that if every language in coNP has a constant-round interactive proof system, then the… Expand

Is this relevant?

Highly Cited

2003

Highly Cited

2003

Bayesian inference is an important problem with numerous applications in probabilistic reasoning. Counting satisfying assignments… Expand

Is this relevant?

Highly Cited

2003

Highly Cited

2003

AbstractTwo natural classes of counting problems that are interreducible
under approximation-preserving reductions are: (i) those… Expand

Is this relevant?