Hardness of Segment Cover, Contiguous SAT and Visibility with Uncertain Obstacles.
Sharareh AlipourSalman ParsaPublished in: COCOA (2020)
Keyphrases
- phase transition
- satisfiability problem
- sat problem
- sat solvers
- uncertain information
- computational complexity
- np complete
- decision making
- np hard
- stochastic local search algorithms
- incomplete information
- autonomous robot navigation
- neural network
- constraint satisfaction
- worst case
- search algorithm
- temporal logic
- search strategies
- possibility theory
- state space