Estimating the Density of States of Boolean Satisfiability Problems on Classical and Quantum Computing Platforms.
Tuhin SahaiAnurag MishraJose Miguel PasiniSusmit JhaPublished in: CoRR (2019)
Keyphrases
- satisfiability problem
- computing platform
- conjunctive normal form
- np complete
- phase transition
- computing systems
- search algorithm
- temporal logic
- distributed computing
- sat problem
- davis putnam logemann loveland
- cloud computing
- stochastic local search
- boolean functions
- parallel computing
- computing environments
- development environment
- computer systems
- first order logic
- databases
- max sat
- special case
- trusted computing
- davis putnam