Login / Signup

An Oracle with no UP-Complete Sets, but NP=PSPACE.

David DingelFabian EgidyChristian Glaßer
Published in: CoRR (2024)
Keyphrases
  • pspace complete
  • np complete
  • temporal logic
  • database
  • information retrieval
  • website
  • data structure
  • computational complexity
  • evolutionary algorithm
  • data model
  • oracle database
  • set theoretic
  • complexity bounds