Publisher
Springer Science and Business Media LLC
Subject
Computational Theory and Mathematics,General Mathematics,Theoretical Computer Science,Computational Theory and Mathematics,Theoretical Computer Science
Reference10 articles.
1. T. Baker, J. Gill, R. Solovay, Relativizations of theP = NP? Question,SIAM J. Computing, 4, 4, Dec. 1975, pp. 431–442.
2. T. Baker, A. Selman, A Second Step toward the Polynomial Hierarchy,17th Ann. IEEE Symp. on Foundations of Comp. Sci., 1976, pp. 71–75, also published inTheoretical Comp. Sci. 8, 1979, pp. 177–187.
3. H. Heller, Relativized Polynomial Hierarchies Extending Two Levels, Dissertation, Technische Universität München, 1981.
4. R. Ladner, N. Lynch, A. Selman, Comparison of Polynomial-Time Reducibilities,Proc. 6th Ann Symp. on the Theory of Computing, Seattle, Washington, 1974, pp. 110–121, also published inTheoretical Comp. Sci. 1, 1975, pp. 103–123.
5. T. Long, On Some Polynomial Time Reducibilities, Dissertation, Purdue University, 1978.
Cited by
22 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. References;Theory of Computational Complexity;2014-06-13
2. Bibliography;Theory of Computational Complexity;2013-12-06
3. THE DOT-DEPTH AND THE POLYNOMIAL HIERARCHIES CORRESPOND ON THE DELTA LEVELS;International Journal of Foundations of Computer Science;2005-08
4. Collapsing Recursive Oracles for Relativized Polynomial Hierarchies;Fundamentals of Computation Theory;2005
5. The Dot-Depth and the Polynomial Hierarchy Correspond on the Delta Levels;Developments in Language Theory;2004