ECCC-TR05-102'

BibTeX

@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   = {Electronic Colloquium on Computational Complexity (ECCC)},
  number    = {102},
  year      = {2005},
  ee        = {http://eccc.hpi-web.de/eccc-reports/2005/TR05-102/index.html},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}