solving #SAT in poly(number of vars) and exp(number of clauses)?

Is there any algorithm to compute #SAT in polynomial time in the number of variables (and exponential in smth. else, e.g. in the number of clauses)?


Relevant Pages

  • 6P=NP: Proof: Nondeterministic Algorithm
    ... each time the algorithm is run the resulting guess may differ. ... be done in Oor polynomial time. ... verifies x if there exists a certificate y such ... Algorithm A verifies language L if for any string x Î ...
  • Re: simple and beauty strategy
    ... The relation between the complexity classes P and NP is studied in ... positive solutions can be verified in polynomial time given the right ... the NP-complete problems are the "toughest" ... that every algorithm which decides the truth of Presburger statements ...
  • Please Help
    ... Instead of a deterministic Turing machine, ... The theoretical notion of "quick" used here is that of an algorithm ... in polynomial time, so this problem is in '''NP'''. ...
  • Re: Aspiring highest-order programmer
    ... > that today's programmers repeat the mistakes of the past because their ... not the algorithm choosen to solve it. ... it means that there is no known polynomial time algorithm to ... algorithm to solve any NP-complete problem, ...
  • Re: JSH: Nearly done
    ... my response to your "polynomial time" below.) ... algorithms really are, so I'll tell you: For a factoring algorithm to ... it doesn't hurt to use recursion in a "proof of concept" ...