Estimating the Density of States of Boolean Satisfiability Problems on Classical and Quantum Computing Platforms.
Tuhin SahaiAnurag MishraJose Miguel PasiniSusmit JhaPublished in: AAAI (2020)
Keyphrases
- satisfiability problem
- computing platform
- conjunctive normal form
- search algorithm
- np complete
- computing systems
- phase transition
- temporal logic
- davis putnam logemann loveland
- distributed computing
- parallel computing
- cloud computing
- computing environments
- stochastic local search
- sat problem
- mazurkiewicz traces
- boolean functions
- sat instances
- development environment
- first order logic
- trusted computing
- distributed systems
- max sat
- shared memory
- intelligent agents
- state variables
- finite domain
- application development
- embedded systems
- davis putnam
- cellular automata
- information systems