3

I have a meta-complexity question: Are there reasons to believe that it is more difficult to prove P != NP than, say PSPACE != EXPTIME or BPP != BQP?

D.W.
  • 167,959
  • 22
  • 232
  • 500
tparker
  • 1,174
  • 7
  • 16

0 Answers0