Approximating the Satisfiability Threshold for Random k-XOR-formulas
From MaRDI portal
Recommendations
- Satisfiability threshold for random XOR-CNF formulas
- Smooth and sharp thresholds for random{k}-XOR-CNF satisfiability
- Smooth and sharp thresholds for random{k}-XOR-CNF satisfiability
- Approximating the unsatisfiability threshold of random formulas
- Approximating the unsatisfiability threshold of random formulas (extended abstract)
- A General Upper Bound for the Satisfiability Threshold of Randomr-SAT Formulae
- The satisfiability threshold for \(k\)-XORSAT
- Random 2-XORSAT at the Satisfiability Threshold
- Exact thresholds for DPLL on random XOR-SAT and NP-complete extensions of XOR-SAT
- Kolmogorov complexity based upper bounds for the unsatisfiability threshold of random \(k\)-SAT
Cited in
(14)- On the thresholds in linear and nonlinear Boolean equations
- Random 2 XORSAT phase transition
- scientific article; zbMATH DE number 5547881 (Why is no real title available?)
- Smooth and sharp thresholds for random{k}-XOR-CNF satisfiability
- The satisfiability threshold for \(k\)-XORSAT
- Satisfiability of random systems of equations with nonuniform sampling of two-valued unknowns
- On the phase transitions of random \(k\)-constraint satisfaction problems
- On unique satisfiability and the threshold behavior of randomized reductions
- 2-Xor revisited: satisfiability and probabilities of functions
- Satisfiability threshold for random XOR-CNF formulas
- Satisfiability thresholds beyond \(k\)-XORSAT
- The 3-XORSAT threshold.
- scientific article; zbMATH DE number 7758304 (Why is no real title available?)
- Smooth and sharp thresholds for random{k}-XOR-CNF satisfiability
This page was built for publication: Approximating the Satisfiability Threshold for Random k-XOR-formulas
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4802163)
