BibTeX record journals/jcss/AchlioptasBM04

download as .bib file

@article{DBLP:journals/jcss/AchlioptasBM04,
  author       = {Dimitris Achlioptas and
                  Paul Beame and
                  Michael S. O. Molloy},
  title        = {A sharp threshold in proof complexity yields lower bounds for satisfiability
                  search},
  journal      = {J. Comput. Syst. Sci.},
  volume       = {68},
  number       = {2},
  pages        = {238--268},
  year         = {2004},
  url          = {https://doi.org/10.1016/j.jcss.2003.07.011},
  doi          = {10.1016/J.JCSS.2003.07.011},
  timestamp    = {Tue, 16 Feb 2021 14:04:17 +0100},
  biburl       = {https://dblp.org/rec/journals/jcss/AchlioptasBM04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics

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.