Clause shortening combined with pruning yields a new upper bound for deterministic SAT algorithms
- Evgeny Dantsin
- , Edward A. Hirsch
- , Alexander Wolpert
Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review
14
Scopus
citations