Publisher
Springer Berlin Heidelberg
Reference4 articles.
1. Adleman, L. “Two theorems on random polynomial time”, 19th Annual Symposium on Foundations of Computer Science, 1978.
2. Baker, Gill, Solovay, “Relativizations of the P = ? NP question,” SICOMP 1977.
3. Kannan, Unpublished.
4. Rackoff, Relativized questions involving probabilistic algorithms, JACM V. 29, 1982, p. 261.
Cited by
29 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Hard Languages in NP ∩ coNP and NIZK Proofs from Unstructured Hardness;Proceedings of the 55th Annual ACM Symposium on Theory of Computing;2023-06-02
2. Relativization of Gurevich’s Conjectures;Fields of Logic and Computation III;2020
3. Credimus;The Future of Economic Design;2019
4. Computational tameness of classical non-causal models;Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences;2018-01
5. On Complete Problems, Relativizations and Logics for Complexity Classes;Fields of Logic and Computation;2010