Author： Fernandez de la Vega W.
Publisher： Elsevier
ISSN： 0304-3975
Source： Theoretical Computer Science, Vol.265, Iss.1, 2001-08, pp. : 131-146
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
Abstract
Related content
Rigorous results for random (2+p)-SAT
By Achlioptas
Theoretical Computer Science, Vol. 265, Iss. 1, 2001-08 ,pp. :
Access to resources
Recommend
Random 2-SAT with Prescribed Literal Degrees
By Cooper Colin Frieze Alan Sorkin Gregory B.
Algorithmica, Vol. 48, Iss. 3, 2007-07 ,pp. :
Exact Max-SAT solvers for over-constrained problems
Journal of Heuristics, Vol. 12, Iss. 4-5, 2006-09 ,pp. :
Is DNA computing viable for 3-SAT problems?
By Li D.
Theoretical Computer Science, Vol. 290, Iss. 3, 2003-01 ,pp. :
Lower bounds for random 3-SAT via differential equations
Theoretical Computer Science, Vol. 265, Iss. 1, 2001-08 ,pp. :