EDP Sciences logo
Subscriber Authentication Point
Search
Menu
All issues Volume 24 / No 3 (1990) RAIRO-Theor. Inf. Appl., 24 3 (1990) 229-240 References
Free Access
Issue
RAIRO-Theor. Inf. Appl.
Volume 24, Number 3, 1990
Page(s) 229 - 240
DOI https://doi.org/10.1051/ita/1990240302291
Published online 01 February 2017
  1. 1. T. BAKER, J. GILL and R. SOLOVAY, Relativizations of the P=?NP Question, S.I.A.M. J. Comput, Vol. 4, 1975, pp. 431-442. [MR: 395311] [Zbl: 0323.68033] [Google Scholar]
  2. 2. J. BALCÁZAR, Simplicity, Relativizations, and Nondeterminism, S.I.A.M. J. Comput. Vol. 14, 1985, pp. 148-157. [MR: 774935] [Zbl: 0567.68027] [Google Scholar]
  3. 3. J. BALCÁZAR and D. Russo, Immunity and Simplicity in Relativizations of Probabilistic Complexity Classes, R.A.I.R.O. Theoretical Informaties and Applications, Vol. 22, 1988, pp. 227-244. [EuDML: 92307] [MR: 951339] [Zbl: 0647.68053] [Google Scholar]
  4. 4. J. BALCÁZAR and U. SCHÖNING, Bi-Immune Sets for Complexity Classes, Math. Systems Theory, Vol. 18, 1985, pp. 1-10. [MR: 793007] [Zbl: 0572.68035] [Google Scholar]
  5. 5. C. BENNETT and J. GILL, Relative to a Rondom Oracle A, PA≠NPA≠co-NPA with Probability1 S.I.A.M. J. Comput., Vol. 10, 1981, pp. 96-113. [MR: 605606] [Zbl: 0454.68030] [Google Scholar]
  6. 6. M. FURST, J. SAXE and M. SIPSER, Parity, Circuits and the Polynomial-Time Hierarchy, Math. Systems Theory, Vol. 17, 1984, pp. 13-27. [MR: 738749] [Zbl: 0534.94008] [Google Scholar]
  7. 7. J. HASTAD, Almost Optimal Lower Boundsfor Small Depth Circuits, Proc. 18th A.C.M. Symp. on Theory of Computing, 1986, pp. 71-84. [Google Scholar]
  8. 8. S. HOMER and W. MAASS, Oracle Dependent Properties of the Lattice of NP Sets, Theoret. Comput. Sci.,Vol. 24, 1983, pp.279-289. [MR: 716824] [Zbl: 0543.03024] [Google Scholar]
  9. 9. K. Ko, Nonlevelable Sets and Immune Sets in the Accepting Density Hierarchy in NP, Math. Systems Theory, Vol. 18, 1985, pp. 189-205. [MR: 813643] [Zbl: 0586.68043] [Google Scholar]
  10. 10. K. Ko, Relativized Polynomial Time Hierarchies Having Exactly k Levels, S.I.A.M. J. Comput., Vol. 18, 1989, pp. 392-408. [MR: 986675] [Zbl: 0679.68088] [Google Scholar]
  11. 11. C. PAPADIMITRIOU and S. ZACHOS, TWO Remarks on the Power of Counting, Proc. 6th GI Conf. on Theoretical Computer Science, Lecture Notes in Computer Science, Vol. 145, 1983, pp. 269-276. [Zbl: 0506.68039] [Google Scholar]
  12. 12. D. RUSSO, Structural Properties of Complexity Classes, Ph. D. dissertation, University of California, Santa Barbara, 1985. [Google Scholar]
  13. 13. U. SCHÖNING and R. BOOK, Immunity, Relativizations and Nondeterminism, S.I.A.M. J. Comput., Vol. 13, 1984, pp. 329-337. [MR: 739993] [Zbl: 0558.68039] [Google Scholar]
  14. 14. L. TORENVLIET and P. VAN EMDE BOAS, Diagonalization Methods in a Polynomial Setting, Proc. Structure in Complexity Theory Conf., Lecture Notes in Computer Science, Vol.223, 1986, pp. 330-346. [MR: 854907] [Zbl: 0611.68019] [Google Scholar]
  15. 15. A. YAO, Separating the Polynomial-Time Hierarchy by Oracles, Proc. 26th I.E.E.E. Symp. on Foundations of Computer Science, 1985, pp. 1-10. [Google Scholar]

Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.

Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.

Initial download of the metrics may take a while.