default search action
BibTeX record conf/stoc/BeameKPS98
@inproceedings{DBLP:conf/stoc/BeameKPS98, author = {Paul Beame and Richard M. Karp and Toniann Pitassi and Michael E. Saks}, editor = {Jeffrey Scott Vitter}, title = {On the Complexity of Unsatisfiability Proofs for Random \emph{k}-CNF Formulas}, booktitle = {Proceedings of the Thirtieth Annual {ACM} Symposium on the Theory of Computing, Dallas, Texas, USA, May 23-26, 1998}, pages = {561--571}, publisher = {{ACM}}, year = {1998}, url = {https://doi.org/10.1145/276698.276870}, doi = {10.1145/276698.276870}, timestamp = {Wed, 14 Nov 2018 10:51:37 +0100}, biburl = {https://dblp.org/rec/conf/stoc/BeameKPS98.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.