Title of article :
An algorithm for the satisfiability problem of formulas in conjunctive normal form
Author/Authors :
Rainer Schuler، نويسنده ,
Issue Information :
روزنامه با شماره پیاپی سال 2005
Pages :
5
From page :
40
To page :
44
Keywords :
complexity theory , NP-completeness , CNF-SAT , Probabilistic algorithms
Journal title :
Journal of Algorithms
Serial Year :
2005
Journal title :
Journal of Algorithms
Record number :
291648
Link To Document :
https://search.isc.ac/dl/search/defaultta.aspx?DTC=10&DC=291648
