Title of article :
New upper bound for the #3-SAT problem
Author/Authors :
Konstantin Kutzkov، نويسنده ,
Issue Information :
دوهفته نامه با شماره پیاپی سال 2007
Pages :
5
From page :
1
To page :
5
Keywords :
analysis of algorithms , Satisfiability , Counting solutions
Journal title :
Information Processing Letters
Serial Year :
2007
Journal title :
Information Processing Letters
Record number :
130521
Link To Document :
https://search.isc.ac/dl/search/defaultta.aspx?DTC=10&DC=130521
بازگشت