-
1
-
-
0030165961
-
Oracles and queries that are sufficient for exact learning
-
N. Bshouty, R. Cleve, R. Gavaldà, S. Kannan, and C. Tamon, Oracles and queries that are sufficient for exact learning, J. Comput. and System Sci. 52(3), 421-433, 1996.
-
(1996)
J. Comput. and System Sci.
, vol.52
, Issue.3
, pp. 421-433
-
-
Bshouty, N.1
Cleve, R.2
Gavaldà, R.3
Kannan, S.4
Tamon, C.5
-
2
-
-
84870737568
-
Nonrelativizing separations
-
IEEE
-
H. Buhrman, L. Fortnow, and T. Thierauf, Nonrelativizing separations, in Proc. the 13th IEEE Conference on Computational Complexity (CCC'98), IEEE, 8-12, 1998.
-
(1998)
Proc. the 13th IEEE Conference on Computational Complexity (CCC'98)
, pp. 8-12
-
-
Buhrman, H.1
Fortnow, L.2
Thierauf, T.3
-
3
-
-
0039341370
-
With probability one, a random oracle separates PSPACE from the polynomial-time hierarchy
-
ACM
-
J-Y. Cai, With probability one, a random oracle separates PSPACE from the polynomial-time hierarchy, in Proc. 18th ACM Symposium on Theory of Computing (STOC'86), ACM, 21-29, 1986.
-
(1986)
Proc. 18th ACM Symposium on Theory of Computing (STOC'86)
, pp. 21-29
-
-
Cai, J.-Y.1
-
4
-
-
1842505229
-
-
journal version appeared
-
See also the journal version appeared in J. Comput. and System Sci. 38(1): 68-85 (1989).
-
(1989)
J. Comput. and System Sci.
, vol.38
, Issue.1
, pp. 68-85
-
-
-
6
-
-
84855625726
-
-
Research Report C-167, Dept. of Math. Comput. Sci., Tokyo Inst. of Tech.
-
J-Y. Cai and O. Watanabe, Research Report C-167, Dept. of Math. Comput. Sci., Tokyo Inst. of Tech., 2003. Available from www.is.titech.ac.jp/research/research-report/C/index.html.
-
(2003)
-
-
Cai, J.-Y.1
Watanabe, O.2
-
7
-
-
0019694529
-
Parity, circuits, and the polynomial time hierarchy
-
IEEE
-
M. Furst, J. Saxe, and M. Sipser, Parity, circuits, and the polynomial time hierarchy, in Proc. 22nd IEEE Symposium on Foundations of Computer Science (FOCS'81), IEEE, 260-270, 1981.
-
(1981)
Proc. 22nd IEEE Symposium on Foundations of Computer Science (FOCS'81)
, pp. 260-270
-
-
Furst, M.1
Saxe, J.2
Sipser, M.3
-
9
-
-
0021518814
-
On relativized polynomial and exponential computations
-
H. Heller, On relativized polynomial and exponential computations, SIAM J. Comput. 13(4), 717-725, 1984.
-
(1984)
SIAM J. Comput.
, vol.13
, Issue.4
, pp. 717-725
-
-
Heller, H.1
-
10
-
-
0343474117
-
Circuit-size lower bounds and non-reducibility to sparse sets
-
R. Kannan, Circuit-size lower bounds and non-reducibility to sparse sets, Information and Control, 55, 40-56, 1982.
-
(1982)
Information and Control
, vol.55
, pp. 40-56
-
-
Kannan, R.1
-
12
-
-
0040061529
-
New collapse consequences of NP having small circuits
-
J. Köbler and O. Watanabe, New collapse consequences of NP having small circuits, SIAM J. Comput., 28, 311-324, 1998.
-
(1998)
SIAM J. Comput.
, vol.28
, pp. 311-324
-
-
Köbler, J.1
Watanabe, O.2
-
13
-
-
84957811473
-
Super-Polynomial versus half-exponential circuit size in the exponential hierarchy
-
Proc. 5th Annual International Conference on Computing and Combinatorics (COCOON'99)
-
P.B. Miltersen, N.V. Vinodchandran, and O. Watanabe, Super-Polynomial versus half-exponential circuit size in the exponential hierarchy, in Proc. 5th Annual International Conference on Computing and Combinatorics (COCOON'99), Lecture Notes in Computer Science 1627, 210-220, 1999.
-
(1999)
Lecture Notes in Computer Science
, vol.1627
, pp. 210-220
-
-
Miltersen, P.B.1
Vinodchandran, N.V.2
Watanabe, O.3
|