Re: More beginner questions about SAT...
- From: "D. C." <enharmonix@xxxxxxxxx>
- Date: 22 Sep 2006 06:51:30 -0700
sasha mal wrote:
My question would be:
is there a SAT solving algorithm working in poly(number of variables n)
and exp(number of clauses m), smth. like O(n^9 * 2^m)?
Regards
Sasha
I'm afraid I'm too much of a beginner to understand the significance of
that question, otherwise I probably would have asked it... ? However,
aren't there already solvers w/ that time complexity anyway?
.
- Follow-Ups:
- Re: More beginner questions about SAT...
- From: sasha mal
- Re: More beginner questions about SAT...
- References:
- More beginner questions about SAT...
- From: D. C.
- Re: More beginner questions about SAT...
- From: sasha mal
- More beginner questions about SAT...
- Prev by Date: the lowest number of comparisons in string matching
- Next by Date: (Probably flawed) Polynomial time Graph Isomorphism
- Previous by thread: Re: More beginner questions about SAT...
- Next by thread: Re: More beginner questions about SAT...
- Index(es):
Relevant Pages
|