default search action
BibTeX record conf/ciac/DantsinHW06
@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} }
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.