BibTeX record conf/ciac/DantsinHW06

download as .bib file

@inproceedings{DBLP:conf/ciac/DantsinHW06,
  author       = {Evgeny Dantsin and
                  Edward A. Hirsch and
                  Alexander Wolpert},
  editor       = {Tiziana Calamoneri and
                  Irene Finocchi and
                  Giuseppe F. Italiano},
  title        = {Clause Shortening Combined with Pruning Yields a New Upper Bound for
                  Deterministic {SAT} Algorithms},
  booktitle    = {Algorithms and Complexity, 6th Italian Conference, {CIAC} 2006, Rome,
                  Italy, May 29-31, 2006, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {3998},
  pages        = {60--68},
  publisher    = {Springer},
  year         = {2006},
  url          = {https://doi.org/10.1007/11758471\_9},
  doi          = {10.1007/11758471\_9},
  timestamp    = {Sat, 30 Sep 2023 09:36:51 +0200},
  biburl       = {https://dblp.org/rec/conf/ciac/DantsinHW06.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics