Login / Signup

Does the Polynomial Hierarchy Collapse if Onto Functions are Invertible?

Harry BuhrmanLance FortnowMichal KouckýJohn D. RogersNikolai K. Vereshchagin
Published in: Theory Comput. Syst. (2010)
Keyphrases
  • polynomial hierarchy
  • databases
  • dl lite
  • disjunctive logic programming
  • sample size
  • incomplete information