Reachability Problem for Polynomial Iteration Is PSPACE-complete.
Reino NiskanenPublished in: RP (2017)
Keyphrases
- pspace complete
- np complete
- model checking
- decision problems
- satisfiability problem
- strips planning
- exptime complete
- state space
- tree automata
- computational complexity
- temporal logic
- coalition logic
- transitive closure
- np hard
- causal graph
- query language
- objective function
- dynamic systems
- bayesian networks
- optimal policy