New worst-case upper bounds for SAT

MaRDI QIDQ2749858zbMATH OpenFDO

Authors Edward A. Hirsch

Publication date 21 October 2001

zbMATH Keywords

satisfiabilitytransformation rules

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Recommendations

• New worst-case upper bounds for SAT
• scientific article; zbMATH DE number 1303594
• Publication:4938646
• New Upper Bounds for Maximum Satisfiability
• New methods for 3-SAT decision and worst-case analysis

Cited in

(13)

• New worst-case upper bounds for SAT
• Solving SAT by algorithm transform of Wu's method
• New width parameters for SAT and \#SAT
• Algorithms for Sat and upper bounds on their complexity
• Clause Shortening Combined with Pruning Yields a New Upper Bound for Deterministic SAT Algorithms
• SAT-Based Horn Least Upper Bounds
• scientific article; zbMATH DE number 3952007 (Why is no real title available?)
• scientific article; zbMATH DE number 1303594 (Why is no real title available?)
• scientific article; zbMATH DE number 1113996 (Why is no real title available?)
• New Upper Bounds for Maximum Satisfiability
• About some UP-based polynomial fragments of SAT
• Theory and Applications of Satisfiability Testing
• An improved upper bound for SAT

This page was built for publication: New worst-case upper bounds for SAT

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