BibTeX record journals/eccc/ECCC-TR05-102

download as .bib file

@article{DBLP:journals/eccc/ECCC-TR05-102,
  author       = {Evgeny Dantsin and
                  Edward A. Hirsch and
                  Alexander Wolpert},
  title        = {Clause Shortening Combined with Pruning Yields a New Upper Bound for
                  Deterministic {SAT} Algorithms},
  journal      = {Electron. Colloquium Comput. Complex.},
  volume       = {{TR05-102}},
  year         = {2005},
  url          = {https://eccc.weizmann.ac.il/eccc-reports/2005/TR05-102/index.html},
  eprinttype    = {ECCC},
  eprint       = {TR05-102},
  timestamp    = {Wed, 28 Sep 2022 15:27:24 +0200},
  biburl       = {https://dblp.org/rec/journals/eccc/ECCC-TR05-102.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.