Clause Shortening Combined with Pruning Yields a New Upper Bound for Deterministic SAT Algorithms - researchr publication references

researchr

You are not signed in
Sign in
Sign up

Evgeny Dantsin, Edward A. Hirsch, Alexander Wolpert. Clause Shortening Combined with Pruning Yields a New Upper Bound for Deterministic SAT Algorithms. Electronic Colloquium on Computational Complexity (ECCC), (102), 2005. [doi]

No references recorded for this publication.

No citations of this publication recorded.

runs on WebDSL