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

iatsonios@xxxxxxxxx wrote:
I am not sure,but as far as i know the problem of Sat is np-complete,so
it needs exponential amount(2^n)of time to solve it,#sat,is just to
enumerate the solutions of SAT that make it satisfiable,then the #sat
is much harder than SAT,so i believe that only a brute force(&naive
approach )can be utilized for your problem.In case you need something
email me and i will send you any paper that i might have.
Cheers Yannis.

You said me nothing new, but thanks nevertheless ;-).
Cheers,
Sasha.
.