An improved upper bound for SAT
From MaRDI portal
Publication:820534
Recommendations
Cites work
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1303594 (Why is no real title available?)
- scientific article; zbMATH DE number 3803174 (Why is no real title available?)
- A Computing Procedure for Quantification Theory
- A Machine-Oriented Logic Based on the Resolution Principle
- A deterministic \((2-2/(k+1))^{n}\) algorithm for \(k\)-SAT based on local search.
- A satisfiability tester for non-clausal propositional calculus
- Algorithms and Computation
- An Improved SAT Algorithm in Terms of Formula Length
- An algorithm for the satisfiability problem of formulas in conjunctive normal form
- An efficient fixed-parameter algorithm for 3-hitting set
- Exact exponential algorithms.
- Faster \(k\)-SAT algorithms using biased-PPSZ
- New worst-case upper bounds for SAT
- On the complexity of \(k\)-SAT
- STACS 2004
- Solving satisfiability in less than \(2^ n\) steps
- The complexity of theorem-proving procedures
- Theory and Applications of Satisfiability Testing
- Theory and Applications of Satisfiability Testing
- Two systems for proving tautologies, based on the split method
Cited in
(7)- Algorithms and Computation
- Title not available (Why is no real title available?)
- On the possibility of faster \textsc{SAT} algorithms
- Theory and Applications of Satisfiability Testing
- SAT-Based Horn Least Upper Bounds
- About some UP-based polynomial fragments of SAT
- Further improvements for SAT in terms of formula length
This page was built for publication: An improved upper bound for SAT
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q820534)
