Exploring the Computational Complexity of SAT Counting and Uniform Sampling with Phase Transitions.
Olivier ZeyenMaxime CordyGilles PerrouinMathieu AcherPublished in: ICSE Companion (2024)
Keyphrases
- phase transition
- uniform sampling
- np complete
- computational complexity
- satisfiability problem
- sat problem
- randomly generated
- constraint satisfaction
- computational geometry
- combinatorial problems
- sample size
- hard problems
- stochastic local search
- np complete problems
- np hard
- graph coloring
- random instances
- sat instances
- random constraint satisfaction problems
- boolean satisfiability
- constraint satisfaction problems
- decision problems
- special case
- random sat
- output space
- cellular automata
- objective function
- worst case
- davis putnam
- real time rendering
- high dimensional