This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
T. Baker, J. Gill and R. Solovay, Relativzations of the P=?NP question, SIAM J. Comput. 4 (1975), 431–441.
L. Berman and J. Hartmanis, On isomorphisms and density of NP and other complete sets, SIAM J. Comput. 6 (1977), 305–322.
R.V. Book, T.J. Long and A.L. Selman, Quantitative relativizations of complexity classes, SIAM J. Comput., to appear.
G. Brassard, S. Fortune and J. Hopcroft, A note on cryptography and NP∩co-NP — P, Techn. Report TR78-338, Cornell University 1978.
J. Gill, Computational complexity of probabilistic Turing machines, SIAM J. Comput. 6 (1977), 675–695.
J. Hartmanis and J. Hopcroft, Independence results in computer science, SIGACT News 8 (1976), 13–24.
T. Ibaraki, The power of dominance relations in branch-and-bound algorithms, Journal of the ACM 24 (1977), 264–279.
R.M. Karp and R.J. Lipton, Some connections between nonuniform and uniform complexity classes, Proc. 12th ACM Sympos. Theory of Comput., 1980, 302–309.
C.H. Papadimitriou and K. Steiglitz, Combinatorial optimization, Prentice-Hall, 1982.
A.L. Selman, Xu Mei-Rui and R.V. Book, Positive relativizations of complexity classes, SIAM J. Comput. 12 (1983), 565–579.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1984 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Schöning, U. (1984). Robust algorithms: A different approach to oracles. In: Paredaens, J. (eds) Automata, Languages and Programming. ICALP 1984. Lecture Notes in Computer Science, vol 172. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-13345-3_41
Download citation
DOI: https://doi.org/10.1007/3-540-13345-3_41
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-13345-2
Online ISBN: 978-3-540-38886-9
eBook Packages: Springer Book Archive