Searching for "Clause Shortening Combined with Pruning Yields a New Upper Bound for Deterministic SAT Algorithms" – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB

1 documents found, showing 1 through 1.

Clause Shortening Combined with Pruning Yields a New Upper Bound for Deterministic SAT Algorithms
by Evgeny Dantsin, Edwarda. Hirsch, Er Wolpert — 2005 — Electronic Colloquium on Computational Complexity, Report 102
…Clause Shortening Combined with Pruning Yields a New Upper Bound for Deterministic SAT Algorithms…
Cited by 1 (0 self) – Add To MetaCart

Showing 1 through 1.

Try your query at: Scholar | Yahoo! | Ask | MS Live | CSB