An efficient approach to solving random k-SAT problems
From MaRDI portal
An efficient approach to solving random \(k\)-SAT problems
Recommendations
Cites work
- scientific article; zbMATH DE number 2084700 (Why is no real title available?)
- scientific article; zbMATH DE number 1467488 (Why is no real title available?)
- scientific article; zbMATH DE number 1369843 (Why is no real title available?)
- scientific article; zbMATH DE number 956858 (Why is no real title available?)
- A General Upper Bound for the Satisfiability Threshold of Randomr-SAT Formulae
- A machine program for theorem-proving
- Efficient CNF encoding of Boolean cardinality constraints
- Heuristic average-case analysis of the backtrack resolution of random 3-satisfiability instances
- Length of prime implicants and number of solutions of random CNF formulae
- Local search algorithms for SAT: an empirical evaluation
- Relations between average case complexity and approximation complexity
- Some Results on Random Unsatisfiable k-Sat Instances and Approximation Algorithms Applied to Random Structures
- Ten challenges \textit{redux}: recent progress in propositional reasoning and search
- The 3-XORSAT threshold.
- The efficiency of resolution and Davis-Putnam procedures
- The probability of pure literals
- Theory and Applications of Satisfiability Testing
- Theory and Applications of Satisfiability Testing
- Theory and Applications of Satisfiability Testing
Cited in
(14)- Recognizing More Unsatisfiable Random k-SAT Instances Efficiently
- On the limit of branching rules for hard random unsatisfiable 3-SAT
- Theory and Applications of Satisfiability Testing
- scientific article; zbMATH DE number 1929945 (Why is no real title available?)
- Branch-and-bound solves random binary IPs in poly\((n)\)-time
- Principles and Practice of Constraint Programming – CP 2004
- scientific article; zbMATH DE number 5139164 (Why is no real title available?)
- Strong Refutation Heuristics for Random k-SAT
- scientific article; zbMATH DE number 1738648 (Why is no real title available?)
- scientific article; zbMATH DE number 1746684 (Why is no real title available?)
- New models for generating hard random Boolean formulas and disjunctive logic programs
- A probabilistic algorithm for k-SAT based on limited local search and restart
- A collaborative approach for multi-threaded SAT solving
- Theory and Applications of Satisfiability Testing
This page was built for publication: An efficient approach to solving random \(k\)-SAT problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q877837)
