Lower bounds for random 3-SAT via differential equations

Author： Achlioptas D.  

Publisher： Elsevier

ISSN： 0304-3975

Source： Theoretical Computer Science, Vol.265, Iss.1, 2001-08, pp. : 159-185

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Resolution-based lower bounds in MaxSAT

By Li Chu  

Constraints, Vol. 15, Iss. 4, 2010-10 ,pp. : 456-484

Springer Publishing Company

Access to resources Recommend Favorite

Random 2-SAT: results and problems

By Fernandez de la Vega W.  

Theoretical Computer Science, Vol. 265, Iss. 1, 2001-08 ,pp. : 131-146

Elsevier

Access to resources Recommend Favorite

Treewidth Lower Bounds with Brambles

By Bodlaender Hans   Grigoriev Alexander   Koster Arie  

Algorithmica, Vol. 51, Iss. 1, 2008-05 ,pp. : 81-98

Springer Publishing Company

Access to resources Recommend Favorite

Lower bounds for asynchronous consensus

By Lamport Leslie  

Distributed Computing, Vol. 19, Iss. 2, 2006-10 ,pp. : 104-125

Springer Publishing Company

Access to resources Recommend Favorite

Reduced-basis output bounds for approximately parametrized elliptic coercive partial differential equations

By Prud’homme C.   Patera A.T.  

Computing and Visualization in Science, Vol. 6, Iss. 2-3, 2004-03 ,pp. : 147-162

Springer Publishing Company

Access to resources Recommend Favorite