DantsinHW06'

BibTeX

@inproceedings{DBLP:conf/ciac/DantsinHW06,
  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},
  booktitle = {CIAC},
  year      = {2006},
  pages     = {60-68},
  ee        = {http://dx.doi.org/10.1007/11758471_9},
  crossref  = {DBLP:conf/ciac/2006},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

@proceedings{DBLP:conf/ciac/2006,
  editor    = {Tiziana Calamoneri and
               Irene Finocchi and
               Giuseppe F. Italiano},
  title     = {Algorithms and Complexity, 6th Italian Conference, CIAC
               2006, Rome, Italy, May 29-31, 2006, Proceedings},
  booktitle = {CIAC},
  publisher = {Springer},
  series    = {Lecture Notes in Computer Science},
  volume    = {3998},
  year      = {2006},
  isbn      = {3-540-34375-X},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}