%0 Journal Article %1 journals/eccc/ECCC-TR05-102 %A Dantsin, Evgeny %A Hirsch, Edward A. %A Wolpert, Alexander %D 2005 %J Electron. Colloquium Comput. Complex. %K dblp %T Clause Shortening Combined with Pruning Yields a New Upper Bound for Deterministic SAT Algorithms %U http://dblp.uni-trier.de/db/journals/eccc/eccc12.html#TR05-102 %V TR05

@article{journals/eccc/ECCC-TR05-102, added-at = {2022-09-28T00:00:00.000+0200}, author = {Dantsin, Evgeny and Hirsch, Edward A. and Wolpert, Alexander}, biburl = {https://www.bibsonomy.org/bibtex/23330d4d5a1896dc3c582a8bb19ff3516/dblp}, ee = {https://eccc.weizmann.ac.il/eccc-reports/2005/TR05-102/index.html}, interhash = {d66135404c3c7e98768cb87a49b62b84}, intrahash = {3330d4d5a1896dc3c582a8bb19ff3516}, journal = {Electron. Colloquium Comput. Complex.}, keywords = {dblp}, timestamp = {2024-04-08T20:08:58.000+0200}, title = {Clause Shortening Combined with Pruning Yields a New Upper Bound for Deterministic SAT Algorithms}, url = {http://dblp.uni-trier.de/db/journals/eccc/eccc12.html#TR05-102}, volume = {TR05}, year = 2005 }