An improved exponential-time algorithm for k-SAT

DOI10.1109/SFCS.1998.743513MaRDI QIDQ6909455zbMATH OpenFDO

Authors P. Pudlik, F. Zane, Michael Saks, Ramamohan Paturi

Publication date 29 October 2025

Full work available at URL https://doi.org/10.1109/SFCS.1998.743513

Mathematics Subject Classification ID

Proceedings, conferences, collections, etc. pertaining to computer science (68-06)

Cited in

(1)

• Faster algorithm for unique (k,2)-CSP

This page was built for publication: An improved exponential-time algorithm for \(k\)-SAT

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6909455)