With probability one, a random oracle separates PSPACE from the polynomial-time hierarchy
Cited by
10 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Tradeoffs for small-depth Frege proofs;2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS);2022-02
2. An Average-Case Depth Hierarchy Theorem for Boolean Circuits;Journal of the ACM;2017-10-15
3. Near-optimal small-depth lower bounds for small distance connectivity;Proceedings of the forty-eighth annual ACM symposium on Theory of Computing;2016-06-19
4. Complexity Theory Column 89;ACM SIGACT News;2015-12
5. Stringent Relativization;Lecture Notes in Computer Science;2003