Some results on random unsatisfiable k-Sat instances and approximation algorithms applied to random structures
From MaRDI portal
(Redirected from Some results on random unsatisfiable k-Sat instances and approximation algorithms applied to random structures)
Some results on random unsatisfiable \(k\)-Sat instances and approximation algorithms applied to random structures
Some results on random unsatisfiable \(k\)-Sat instances and approximation algorithms applied to random structures
Recommendations
- Some Results on Random Unsatisfiable k-Sat Instances and Approximation Algorithms Applied to Random Structures
- An efficient approach to solving random \(k\)-SAT problems
- scientific article; zbMATH DE number 1002207
- Theory and Applications of Satisfiability Testing
- Kolmogorov complexity based upper bounds for the unsatisfiability threshold of random \(k\)-SAT
- Techniques from combinatorial approximation algorithms yield efficient algorithms for random 2\(k\)-SAT
- The structure of the set of satisfying assignments for a random \(k\)-CNF
- An exact and a randomized approach for the satisfiability problem
- Efficient recognition of random unsatisfiable k-SAT instances by spectral methods
- On the concentration of the number of solutions of random satisfiability formulas
Cited in
(13)- On good algorithms for determining unsatisfiability of propositional formulas
- The structure of the set of satisfying assignments for a random \(k\)-CNF
- Efficient recognition of random unsatisfiable k-SAT instances by spectral methods
- Recognizing more random unsatisfiable 3-SAT instances efficiently
- Some Results on Random Unsatisfiable k-Sat Instances and Approximation Algorithms Applied to Random Structures
- Recognizing more unsatisfiable random 3-SAT instances efficiently
- Recognizing More Unsatisfiable Random k-SAT Instances Efficiently
- Computing unsatisfiable \(k\)-SAT instances with few occurrences per variable
- Algorithms and Computation
- Geometric properties of satisfying assignments of random ε-1-in-kSAT
- Certifying unsatisfiability of random 2k-SAT formulas using approximation techniques.
- Techniques from combinatorial approximation algorithms yield efficient algorithms for random 2\(k\)-SAT
- An efficient approach to solving random \(k\)-SAT problems
This page was built for publication: Some results on random unsatisfiable \(k\)-Sat instances and approximation algorithms applied to random structures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4708577)
