Login / Signup

The Complexity of Approximating PSPACE-Complete Problems for Hierarchical Specifications (Extended Abstract).

Madhav V. MaratheHarry B. Hunt IIIS. S. Ravi
Published in: ICALP (1993)
Keyphrases
  • extended abstract
  • pspace complete
  • np complete
  • decision problems
  • strips planning
  • model checking
  • satisfiability problem
  • computational complexity
  • exptime complete
  • dynamic programming