Complete Boolean satisfiability solving algorithms based on local search
From MaRDI portal
Publication:2434568
Recommendations
Cites work
- scientific article; zbMATH DE number 5139161 (Why is no real title available?)
- scientific article; zbMATH DE number 5547826 (Why is no real title available?)
- scientific article; zbMATH DE number 1798189 (Why is no real title available?)
- scientific article; zbMATH DE number 1448978 (Why is no real title available?)
- A Computing Procedure for Quantification Theory
- A machine program for theorem-proving
- A note on treewidth in random graphs
- Adaptive channel and power allocation of downlink multi-user MC-CDMA systems
- Cross-layer packet scheduling for downlink multiuser OFDM systems
- Local search with edge weighting and configuration checking heuristics for minimum vertex cover
- Many hard examples in exact phase transitions
- Probabilistic analysis of the Davis Putnam procedure for solving the satisfiability problem
- Random constraint satisfaction: easy generation of hard (satisfiable) instances
- SATzilla: portfolio-based algorithm selection for SAT
- Solving SAT and SAT modulo theories, from an abstract Davis-Putnam-Logemann-Loveland procedure to \(\operatorname{DPLL}(T)\)
- Two Hardness Results on Feedback Vertex Sets
Cited in
(8)- Propagation based local search for bit-precise reasoning
- scientific article; zbMATH DE number 1903342 (Why is no real title available?)
- scientific article; zbMATH DE number 4014450 (Why is no real title available?)
- Selection of search strategies for solving 3-SAT problems
- scientific article; zbMATH DE number 2090309 (Why is no real title available?)
- scientific article; zbMATH DE number 2084740 (Why is no real title available?)
- scientific article; zbMATH DE number 1954175 (Why is no real title available?)
- Zeon and idem-Clifford formulations of Boolean satisfiability
This page was built for publication: Complete Boolean satisfiability solving algorithms based on local search
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2434568)