Search from the table of contents of 2.5 million books
Advanced Search (Beta)
Home > Algorithms and Complexity: 6th Italian Conference, CIAC 2006, Rome, Italy, May 29-31, 2006, Proceedings > Clause Shortening Combined with Pruning Yields a New Upper Bound for Deterministic SAT Algorithms
Algorithms and Complexity: 6th Italian Conference, CIAC 2006, Rome, Italy, May 29-31, 2006, Proceedings |
Tiziana Calamoneri; Irene Finocchi; Giuseppe F. Italiano
Springer Berlin Heidelberg
Algorithms and Complexity: 6th Italian Conference, CIAC 2006, Rome, Italy, May 29-31, 2006, Proceedings
Clause Shortening Combined with Pruning Yields a New Upper Bound for Deterministic SAT Algorithms
Authors

Evgeny Dantsin; Edward A. Hirsch; Alexander Wolpert

ARI Id

1674219820603_3433232

Access

Not Available Free

Pages

60-68

DOI

10.1007/11758471_9

Chapter URL

https://rd.springer.com/chapter/10.1007/11758471_9

Table of Contents of Book
Chapters/HeadingsAuthor(s)PagesInfo
Loading...
Chapters/HeadingsAuthor(s)PagesInfo
Similar Books
Similar Chapters
Similar Thesis

Similar News

Similar Articles
Similar Article Headings