On relativized probabilistic polynomial time algorithms

Hisao TANAKA; Masafumi KUDOH

doi:10.2969/jmsj/04910015

Hisao TANAKA, Masafumi KUDOH

Author information

JOURNAL FREE ACCESS

1997 Volume 49 Issue 1 Pages 15-30

DOI https://doi.org/10.2969/jmsj/04910015

Details

Published: 1997 Received: December 16, 1994 Available on J-STAGE: October 20, 2006 Accepted: - Advance online publication: - Revised: -
Correction information
Date of correction: October 20, 2006 Reason for correction: - Correction: CITATION Details: Wrong : BGS 75) T. Baker, J. Gill and R. Solovay, Relativizations of the P=? NP question, SIAM J. Comput., 4 (1975), 431-442.
BDG 88) J. Balcázar, J. Díaz and J. Gabarró, Structural Complexity I, Springer-Verlag, Berlin etc., 1988.
BDG 90) J. Balcázar, J. Díaz and J. Gabarró, Structural Complexity II, Springer-Verlag, Berlin etc., 1990.
BG 81) C. H. Bennett and J. Gill, Relative to random oracle A, P^A≠NP^A≠co_-NP^A with probability 1, SIAM J. Comput., 10 (1981), 96-113.
BI 87) M. Blum and R. Impagliazzo, Generic oracles and oracle classes, 19-th Symposium FOCS, 1987, pp. 118-126.
Do 92) M. Dowd, Generic oracles, uniform machines, and codes, Inform, and Comput., 96 (1992), 65-76.
Pa 94) C. H. Papadimitrious, Computational Complexity, Addison-Wesley, 1994.
Po 86) B. Poizat, Q=NQ?, J. Symbolic Logic, 51 (1986), 22-32.
Ro 67) H. Rogers, Jr., Theory of recursive functions and effective computability, McGraw-Hill, 1967.
Sch 85) U. Schoning, Complexity and Structure, Lecture Notes in Comput. Sci., 211 1985.

Right : [BGS 75] T. Baker, J. Gill and R. Solovay, Relativizations of the P=? NP question, SIAM J. Comput., 4 (1975), 431-442.
[BDG 88] J. Balcázar, J. Díaz and J. Gabarró, Structural Complexity I, Springer-Verlag, Berlin etc., 1988.
[BDG 90] J. Balcázar, J. Díaz and J. Gabarró, Structural Complexity II, Springer-Verlag, Berlin etc., 1990.
[BG 81] C. H. Bennett and J. Gill, Relative to random oracle A, P^A≠NP^A≠co-NP^A with probability 1, SIAM J. Comput., 10 (1981), 96-113.
[BI 87] M. Blum and R. Impagliazzo, Generic oracles and oracle classes, 19-th Symposium FOCS, 1987, pp. 118-126.
[Do 92] M. Dowd, Generic oracles, uniform machines, and codes, Inform, and Comput., 96 (1992), 65-76.
[Pa 94] C. H. Papadimitrious, Computational Complexity, Addison-Wesley, 1994.
[Ro 67] H. Rogers, Jr., Theory of recursive functions and effective computability, McGraw-Hill, 1967.
[Sch 85] U. Schoning, Complexity and Structure, Lecture Notes in Comput. Sci., 211 1985.

Date of correction: October 20, 2006 Reason for correction: - Correction: PDF FILE Details: -

Corresponding author

Correction information

Register with J-STAGE for free!