Robust algorithms: A different approach to oracles
Part of the Lecture Notes in Computer Science book series (LNCS, volume 172)
KeywordsTuring Machine Robust Algorithm Oracle Query Main Result State Deterministic Turing Machine
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Unable to display preview. Download preview PDF.
- 1.T. Baker, J. Gill and R. Solovay, Relativzations of the P=?NP question, SIAM J. Comput. 4 (1975), 431–441.Google Scholar
- 2.L. Berman and J. Hartmanis, On isomorphisms and density of NP and other complete sets, SIAM J. Comput. 6 (1977), 305–322.Google Scholar
- 3.R.V. Book, T.J. Long and A.L. Selman, Quantitative relativizations of complexity classes, SIAM J. Comput., to appear.Google Scholar
- 4.G. Brassard, S. Fortune and J. Hopcroft, A note on cryptography and NP∩co-NP — P, Techn. Report TR78-338, Cornell University 1978.Google Scholar
- 5.J. Gill, Computational complexity of probabilistic Turing machines, SIAM J. Comput. 6 (1977), 675–695.Google Scholar
- 6.J. Hartmanis and J. Hopcroft, Independence results in computer science, SIGACT News 8 (1976), 13–24.Google Scholar
- 7.T. Ibaraki, The power of dominance relations in branch-and-bound algorithms, Journal of the ACM 24 (1977), 264–279.Google Scholar
- 8.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.Google Scholar
- 9.C.H. Papadimitriou and K. Steiglitz, Combinatorial optimization, Prentice-Hall, 1982.Google Scholar
- 10.A.L. Selman, Xu Mei-Rui and R.V. Book, Positive relativizations of complexity classes, SIAM J. Comput. 12 (1983), 565–579.Google Scholar
© Springer-Verlag Berlin Heidelberg 1984