Exact 3-Satisfiability Is Decidable in Time O(2^0.16254n)

By Porschen Stefan   Randerath Bert   Speckenmeyer Ewald  

Annals of Mathematics and Artificial Intelligence, Vol. 43, Iss. 1-4, 2005-01 ,pp. : 173-193

Springer Publishing Company

Access to resources Recommend Favorite

Exact 3-satisfiability is decidable in time O(2^0.16254n )

By Porschen Stefan   Randerath Bert   Speckenmeyer Ewald  

Annals of Mathematics and Artificial Intelligence, Vol. 43, Iss. 1, 2005-01 ,pp. : 173-193

Springer Publishing Company

Access to resources Recommend Favorite

A General Upper Bound for the Satisfiability Threshold of Random r-SAT Formulae

By Dubois O.   Boufkhad Y.  

Journal of Algorithms, Vol. 24, Iss. 2, 1997-08 ,pp. : 395-420

Academic Press

Access to resources Recommend Favorite

A Yet Simpler Proof of The Chain Rule

By Tandra Haryono  

American Mathematical Monthly, Vol. 120, Iss. 10, 2013-12 ,pp. : 900-900

Mathematical Association of America

Access to resources Recommend Favorite

New Upper Bounds for Maximum Satisfiability

By Niedermeier R.   Rossmanith P.  

Journal of Algorithms, Vol. 36, Iss. 1, 2000-07 ,pp. : 63-88

Academic Press

Access to resources Recommend Favorite