Title of article :
Exploiting partial knowledge of satisfying assignments Original Research Article
Author/Authors :
Kazuo Iwama، نويسنده , , Suguru Tamaki، نويسنده ,
Issue Information :
روزنامه با شماره پیاپی سال 2007
Pages :
8
From page :
1596
To page :
1603
Keywords :
CNF satisfiability , Probabilistic algorithm , NP-complete problem
Journal title :
Discrete Applied Mathematics
Serial Year :
2007
Journal title :
Discrete Applied Mathematics
Record number :
886529
Link To Document :
بازگشت