Re: solving #SAT in poly(number of vars) and exp(number of clauses)?
- From: iatsonios@xxxxxxxxx
- Date: 13 Jul 2006 02:29:12 -0700
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.
.
- Follow-Ups:
- References:
- solving #SAT in poly(number of vars) and exp(number of clauses)?
- From: sasha mal
- solving #SAT in poly(number of vars) and exp(number of clauses)?
- Prev by Date: Re: Military logistic problem
- Next by Date: Re: Algorithm to fit rectangles with different areas inside a matrix with lowest complexity
- Previous by thread: solving #SAT in poly(number of vars) and exp(number of clauses)?
- Next by thread: Re: solving #SAT in poly(number of vars) and exp(number of clauses)?
- Index(es):
