Clause shortening combined with pruning yields a new upper bound for deterministic SAT algorithms

Evgeny Dantsin, Edward A. Hirsch, Alexander Wolpert

Research outputpeer-review

9 Citations (Scopus)

Fingerprint Dive into the research topics of 'Clause shortening combined with pruning yields a new upper bound for deterministic SAT algorithms'. Together they form a unique fingerprint.

Математика

Технические дисциплины и материаловедение