Recognizing more unsatisfiable random 3-SAT instances efficiently
From MaRDI portal
Recommendations
- Recognizing More Unsatisfiable Random k-SAT Instances Efficiently
- Recognizing more random unsatisfiable 3-SAT instances efficiently
- Efficient recognition of random unsatisfiable k-SAT instances by spectral methods
- scientific article; zbMATH DE number 1929945
- Some Results on Random Unsatisfiable k-Sat Instances and Approximation Algorithms Applied to Random Structures
Cited in
(10)- The resolution complexity of random graph \(k\)-colorability
- Resolution complexity of random constraint satisfaction problems: Another half of the story
- Efficient recognition of random unsatisfiable k-SAT instances by spectral methods
- Resolution Complexity of Random Constraint Satisfaction Problems: Another Half of the Story
- Recognizing more random unsatisfiable 3-SAT instances efficiently
- Some Results on Random Unsatisfiable k-Sat Instances and Approximation Algorithms Applied to Random Structures
- scientific article; zbMATH DE number 2079359 (Why is no real title available?)
- Exact and approximative algorithms for coloring G(n,p)
- Recognizing More Unsatisfiable Random k-SAT Instances Efficiently
- Techniques from combinatorial approximation algorithms yield efficient algorithms for random 2\(k\)-SAT
This page was built for publication: Recognizing more unsatisfiable random 3-SAT instances efficiently
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4535026)
