An improved upper bound for SAT
From MaRDI portal
Publication:820534
DOI10.1016/j.tcs.2021.06.045OpenAlexW3179743149MaRDI QIDQ820534
Huairui Chu, Zhe Zhang, Mingyu Xiao
Publication date: 27 September 2021
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2007.03829
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Exact exponential algorithms.
- An efficient fixed-parameter algorithm for 3-hitting set
- Solving satisfiability in less than \(2^ n\) steps
- A satisfiability tester for non-clausal propositional calculus
- New worst-case upper bounds for SAT
- Two systems for proving tautologies, based on the split method
- A deterministic \((2-2/(k+1))^{n}\) algorithm for \(k\)-SAT based on local search.
- An Improved SAT Algorithm in Terms of Formula Length
- An algorithm for the satisfiability problem of formulas in conjunctive normal form
- Faster k -SAT algorithms using biased-PPSZ
- STACS 2004
- A Machine-Oriented Logic Based on the Resolution Principle
- A Computing Procedure for Quantification Theory
- The complexity of theorem-proving procedures
- Theory and Applications of Satisfiability Testing
- Theory and Applications of Satisfiability Testing
- Algorithms and Computation
- On the complexity of \(k\)-SAT
This page was built for publication: An improved upper bound for SAT
