Re: More beginner questions about SAT...

Russell Easterly wrote:
"sasha mal" <sashaREMOVEIT.mal@xxxxxxxxxxxxxxxxx> wrote in message
news:eervm0$df4be$2@xxxxxxxxxxxxxxxxxxxxxxxxxxx
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)?

For 3SAT there are 3^m possible ways to choose one
element from each clause. This isn't much of an algorithm since
usually 2^n < 3^m.
Exactly when
m > n (log 2) / (log 3), i.e.
m > n 0.6309...
So what?

Sasha.
.