|
 REFERENCES
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.
| |
1
|
[JY 90] D. Joseph and P. Young, "Self-reducibility: Effects of internal structure on computational complexity," in "Complexity Theory Retrospective," edited by A. Selman, Springer Verlag, 1990, 82-107.
|
| |
2
|
[Ka 87] J. Kadin, "PNP[logn] and sparse Turing complete sets for NP," Proc Structure in Complexity Conference, 2 (1987), 33-40.
|
| |
3
|
[KL 80] R. Karp and R. Lipton, "Some connections between nonuniform and uniform complexity classes," Proc of the 12th ACM STOC, 1980, 302-309. (Also appears as "Turing machines that take advice," L'Ensignement Mathématique 82 (1982), 191-210.)
|
| |
4
|
[Lo 82] T. Long, "A note on sparse oracles for NP," JCSS, 24 (1982), 224-232.
|
| |
5
|
[Ma 82] S. Mahaney, "Sparse complete sets for NP: solution of a conjecture of Berman and Hartmanis," JCSS, 25 (1982), 130-143.
|
| |
6
|
[Ma 89] S. Mahaney, "The isomorphism conjecture and sparse sets," in "Computational Complexity Theory," edited by J. Hartmanis in AMS Proc Symp Applied Math Series, (1989).
|
| |
7
|
|
| |
8
|
|
| |
9
|
[Yo 90] P. Young, "Juris Hartmanis: Fundamental contributions to isomorphism problems," in "Complexity Theory Retrospective," edited by A. Selman, Springer Verlag, (1990), 28-58.
|
|
Adobe Acrobat
QuickTime
Windows Media Player
Real Player
Pdf
G.2