Amin Coja-Oghlan, Andreas Goerdt, André Lanka, Frank Schädlich. Certifying Unsatisfiability of Random 2::::k::::-SAT Formulas Using Approximation Techniques. In Andrzej Lingas, Bengt J. Nilsson, editors, Fundamentals of Computation Theory, 14th International Symposium, FCT 2003, Malmö, Sweden, August 12-15, 2003, Proceedings. Volume 2751 of Lecture Notes in Computer Science, pages 15-26, Springer, 2003. [doi]
@inproceedings{Coja-OghlanGLS03,
title = {Certifying Unsatisfiability of Random 2::::k::::-SAT Formulas Using Approximation Techniques},
author = {Amin Coja-Oghlan and Andreas Goerdt and André Lanka and Frank Schädlich},
year = {2003},
url = {http://springerlink.metapress.com/openurl.asp?genre=article&issn=0302-9743&volume=2751&spage=15},
researchr = {https://researchr.org/publication/Coja-OghlanGLS03},
cites = {0},
citedby = {0},
pages = {15-26},
booktitle = {Fundamentals of Computation Theory, 14th International Symposium, FCT 2003, Malmö, Sweden, August 12-15, 2003, Proceedings},
editor = {Andrzej Lingas and Bengt J. Nilsson},
volume = {2751},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {3-540-40543-7},
}