Approximating the Unsatisfiability Threshold of Random Formulas (Extended Abstract)
Lecture Notes in Computer Science - Germany
doi 10.1007/3-540-61680-2_44
Full Text
Open PDFAbstract
Available in full text
Date
January 1, 1996
Authors
Publisher
Springer Berlin Heidelberg