Gregory B. Sorkin. Some Notes on Random Satisfiability. In Kathleen Steinhöfel, editor, Stochastic Algorithms: Foundations and Applications, International Symposium, SAGA 2001 Berlin, Germany, December 13-14, 2001, Proceedings. Volume 2264 of Lecture Notes in Computer Science, pages 117-130, Springer, 2001. [doi]
@inproceedings{Sorkin01,
title = {Some Notes on Random Satisfiability},
author = {Gregory B. Sorkin},
year = {2001},
url = {http://link.springer.de/link/service/series/0558/bibs/2264/22640117.htm},
researchr = {https://researchr.org/publication/Sorkin01},
cites = {0},
citedby = {0},
pages = {117-130},
booktitle = {Stochastic Algorithms: Foundations and Applications, International Symposium, SAGA 2001 Berlin, Germany, December 13-14, 2001, Proceedings},
editor = {Kathleen Steinhöfel},
volume = {2264},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {3-540-43025-3},
}