-
2
-
-
0027624212
-
Almost-everywhere complexity hierarchies for nondeterministic time
-
E. Allender, R. Beigel, U. Hertrampf, and S. Homer. Almost-everywhere complexity hierarchies for nondeterministic time. Theoretical Computer Science, 115:225-241, 1993.
-
(1993)
Theoretical Computer Science
, vol.115
, pp. 225-241
-
-
Allender, E.1
Beigel, R.2
Hertrampf, U.3
Homer, S.4
-
3
-
-
0024874128
-
On the relativized power of additional accepting paths
-
IEEE Computer Society Press, Los Alamitos, CA, June
-
R. Beigel. On the relativized power of additional accepting paths. In Proceedings of the 4th Structure in Complexity Theory Conference, pages 216-224. IEEE Computer Society Press, Los Alamitos, CA, June 1989.
-
(1989)
Proceedings of the 4th Structure in Complexity Theory Conference
, pp. 216-224
-
-
Beigel, R.1
-
5
-
-
0024611658
-
The boolean hierarchy, II: Applications
-
J. Cai, T. Gundermann, J. Hartmanis, L. Hemachandra, V. Sewelson, K. Wagner, and G. Wechsung. The boolean hierarchy, II: Applications. SIAM Journal on Computing, 18(1):95-111, 1989.
-
(1989)
SIAM Journal on Computing
, vol.18
, Issue.1
, pp. 95-111
-
-
Cai, J.1
Gundermann, T.2
Hartmanis, J.3
Hemachandra, L.4
Sewelson, V.5
Wagner, K.6
Wechsung, G.7
-
6
-
-
0027252438
-
Sperner's lemma and robust machines
-
IEEE Computer Society Press, Los Alamitos, CA, May
-
P. Crescenzi and R. Silvestri. Sperner's lemma and robust machines. In Proceedings of the 8th Structure in Complexity Theory Conference, pages 194-199. IEEE Computer Society Press, Los Alamitos, CA, May 1993.
-
(1993)
Proceedings of the 8th Structure in Complexity Theory Conference
, pp. 194-199
-
-
Crescenzi, P.1
Silvestri, R.2
-
7
-
-
0026218974
-
Strong and robustly strong polynomial time reducibilities to sparse sets
-
R. Gavaldà and J. Balcázar. Strong and robustly strong polynomial time reducibilities to sparse sets. Theoretical Computer Science, 88(1):1-14, 1991.
-
(1991)
Theoretical Computer Science
, vol.88
, Issue.1
, pp. 1-14
-
-
Gavaldà, R.1
Balcázar, J.2
-
8
-
-
0000595574
-
Computational complexity of probabilistic turing machines
-
J. Gill. Computational complexity of probabilistic Turing machines. SIAM Journal on Computing, 6(4):675-695, 1977.
-
(1977)
SIAM Journal on Computing
, vol.6
, Issue.4
, pp. 675-695
-
-
Gill, J.1
-
10
-
-
0008235181
-
Nondeterministically selective sets
-
L. Hemaspaandra, A. Hoene, A. Naik, M. Ogiwara, A. Selman, T. Thierauf, and J. Wang. Nondeterministically selective sets. International Journal of Foundations of Computer Science, 6(4):403-416, 1995.
-
(1995)
International Journal of Foundations of Computer Science
, vol.6
, Issue.4
, pp. 403-416
-
-
Hemaspaandra, L.1
Hoene, A.2
Naik, A.3
Ogiwara, M.4
Selman, A.5
Thierauf, T.6
Wang, J.7
-
11
-
-
85034272059
-
Recent directions in algorithmic research
-
Proceedings of the 5th GI Conference on Theoretical Computer Science, Springer-Verlag, Berlin
-
J. Hopcroft. Recent directions in algorithmic research. In Proceedings of the 5th GI Conference on Theoretical Computer Science, pages 123-134. Lecture Notes in Computer Science #104. Springer-Verlag, Berlin, 1981.
-
(1981)
Lecture Notes in Computer Science
, vol.104
, pp. 123-134
-
-
Hopcroft, J.1
-
12
-
-
38249025494
-
NP[log n] and sparse turing-complete sets for NP
-
NP[log n] and sparse Turing-complete sets for NP. Journal of Computer and System Sciences, 39(3):282-298, 1989.
-
(1989)
Journal of Computer and System Sciences
, vol.39
, Issue.3
, pp. 282-298
-
-
Kadin, J.1
-
13
-
-
0026205149
-
Non-uniform proof systems: A new framework to describe nonuniform and probabilistic complexity classes
-
J. Kämper. Non-uniform proof systems: a new framework to describe nonuniform and probabilistic complexity classes. Theoretical Computer Science, 85(2):305-331, 1991.
-
(1991)
Theoretical Computer Science
, vol.85
, Issue.2
, pp. 305-331
-
-
Kämper, J.1
-
14
-
-
84944053247
-
Some connections between nonuniform and uniform complexity classes
-
ACM Press, New York, April
-
R. Karp and R. Lipton. Some connections between nonuniform and uniform complexity classes. In Proceedings of the 12th ACM Symposium on Theory of Computing, pages 302-309. ACM Press, New York, April 1980. An extended version has also appeared as: Turing machines that take advice, L'Enseignement Mathématique, 2nd series, 28: 191-209, 1982.
-
(1980)
Proceedings of the 12th ACM Symposium on Theory of Computing
, pp. 302-309
-
-
Karp, R.1
Lipton, R.2
-
15
-
-
0000517449
-
Turing machines that take advice
-
R. Karp and R. Lipton. Some connections between nonuniform and uniform complexity classes. In Proceedings of the 12th ACM Symposium on Theory of Computing, pages 302-309. ACM Press, New York, April 1980. An extended version has also appeared as: Turing machines that take advice, L'Enseignement Mathématique, 2nd series, 28: 191-209, 1982.
-
(1982)
L'Enseignement Mathématique, 2nd Series
, vol.28
, pp. 191-209
-
-
-
16
-
-
4243414492
-
High sets for NP
-
D. Zu and K. Ko, editors, Kluwer, Dordrecht
-
J. Köbler and U. Schöning. High sets for NP. In D. Zu and K. Ko, editors, Advances in Algorithms, Languages, and Complexity, pages 139-156. Kluwer, Dordrecht, 1997.
-
(1997)
Advances in Algorithms, Languages, and Complexity
, pp. 139-156
-
-
Köbler, J.1
Schöning, U.2
-
17
-
-
84958052751
-
New collapse consequences of NP having small circuits
-
Proceedings of the 22nd International Colloquium on Automata, Languages, and Programming, Springer-Verlag, Berlin
-
J. Köbler and O. Watanabe. New collapse consequences of NP having small circuits. In Proceedings of the 22nd International Colloquium on Automata, Languages, and Programming, pages 196-207. Lecture Notes in Computer Science #944. Springer-Verlag, Berlin, 1995.
-
(1995)
Lecture Notes in Computer Science
, vol.944
, pp. 196-207
-
-
Köbler, J.1
Watanabe, O.2
-
18
-
-
0002600157
-
Strong nondeterministic polynomial-time reducibilities
-
T. Long. Strong nondeterministic polynomial-time reducibilities. Theoretical Computer Science, 21:1-25, 1982.
-
(1982)
Theoretical Computer Science
, vol.21
, pp. 1-25
-
-
Long, T.1
-
19
-
-
0022756937
-
Relativizing complexity classes with sparse oracles
-
T. Long and A. Selman. Relativizing complexity classes with sparse oracles. Journal of the ACM, 33(3):618-627, 1986.
-
(1986)
Journal of the ACM
, vol.33
, Issue.3
, pp. 618-627
-
-
Long, T.1
Selman, A.2
-
20
-
-
0040156601
-
Polynomial time enumeration reducibility
-
A. Selman. Polynomial time enumeration reducibility. SIAM Journal on Computing, 7(4):440-457, 1978.
-
(1978)
SIAM Journal on Computing
, vol.7
, Issue.4
, pp. 440-457
-
-
Selman, A.1
-
23
-
-
0025507099
-
Bounded query classes
-
K. Wagner. Bounded query classes. SIAM Journal on Computing, 19(5):833-846, 1990.
-
(1990)
SIAM Journal on Computing
, vol.19
, Issue.5
, pp. 833-846
-
-
Wagner, K.1
-
24
-
-
0000205276
-
Some consequences of non-uniform conditions on uniform classes
-
C. Yap. Some consequences of non-uniform conditions on uniform classes. Theoretical Computer Science, 26:287-300, 1983.
-
(1983)
Theoretical Computer Science
, vol.26
, pp. 287-300
-
-
Yap, C.1
|