Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

Sharp-SAT

In computational complexity theory, #SAT, or Sharp-SAT, a function problem related to the Boolean satisfiability problem, is the problem of counting… Expand
Wikipedia

Papers overview

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
  • figure 1
Is this relevant?
2015
2015
We look at dynamic programming algorithms for propositional model counting, also called #SAT, and MaxSAT. Tools from graph… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
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
  • table 1
  • figure 1
  • figure 2
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
  • figure 1
  • figure 2
  • figure 3
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
  • figure 1
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
  • figure 1
  • figure 2
  • figure 3
  • figure 4
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
  • figure 3
  • figure 1
  • table 1
  • table 2
  • figure 4
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
  • table 1
  • table 2
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
  • table 1
Is this relevant?