Hardness of CONTIGUOUS SAT and Visibility with Uncertain Obstacles.
Sharareh AlipourSalman ParsaPublished in: CoRR (2018)
Keyphrases
- phase transition
- satisfiability problem
- sat problem
- sat solvers
- computational complexity
- decision making
- np complete
- np hard
- constraint satisfaction
- sat solving
- propositional satisfiability
- information theoretic
- random instances
- max sat
- uncertain information
- sat instances
- stochastic local search
- np complete problems
- autonomous robot navigation
- boolean satisfiability
- obstacle detection
- learning theory
- incomplete information