SAT distributions with planted assignments and phase transitions between decision and optimization problems
From MaRDI portal
Publication:2581547
Recommendations
- SAT Distributions with Phase Transitions between Decision and Optimization Problems
- A wealth of SAT distributions with planted assignments
- The SAT-UNSAT transition for random constraint satisfaction problems
- Phase transition for local search on planted SAT
- On the complexity of random satisfiability problems with planted solutions
- On the complexity of random satisfiability problems with planted solutions (extended abstract)
- Solving non-uniform planted and filtered random SAT formulas greedily
- Random MAX SAT, random MAX CUT, and their phase transitions
- scientific article; zbMATH DE number 2079360
- A Stochastic Limit Approach to the SAT Problem
Cites work
- scientific article; zbMATH DE number 3168330 (Why is no real title available?)
- scientific article; zbMATH DE number 67483 (Why is no real title available?)
- scientific article; zbMATH DE number 2084703 (Why is no real title available?)
- scientific article; zbMATH DE number 956863 (Why is no real title available?)
- A linear-time algorithm for testing the truth of certain quantified Boolean formulas
- A study of complexity transitions on the asymmetric traveling salesman problem
- Critical Behavior in the Satisfiability of Random Boolean Expressions
- Determining computational complexity from characteristic ``phase transitions
- Phase transitions and the search problem
- The TSP phase transition
- The probabilistic method. With an appendix on the life and work of Paul Erdős.
Cited in
(4)
This page was built for publication: SAT distributions with planted assignments and phase transitions between decision and optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2581547)