-
2
-
-
0034874724
-
m
-
IEEE Computer Society Press, Silver Spring, MD
-
m, in: Sixteenth Annual IEEE Conference on Computational Complexity, IEEE Computer Society Press, Silver Spring, MD, 2001, pp. 184-187.
-
(2001)
Sixteenth Annual IEEE Conference on Computational Complexity
, pp. 184-187
-
-
Alon, N.1
Beigel, R.2
-
3
-
-
0026940019
-
Multiparty protocols, pseudorandom generators for logspace, and time-space trade-offs
-
Babai L., Nisan N., Szegedy M. Multiparty protocols, pseudorandom generators for logspace, and time-space trade-offs. J. Comput. System Sci. 45(2):1992;204-232.
-
(1992)
J. Comput. System Sci.
, vol.45
, Issue.2
, pp. 204-232
-
-
Babai, L.1
Nisan, N.2
Szegedy, M.3
-
5
-
-
0009631578
-
Complex polynomials and circuit lower bounds for modular counting
-
Barrington D.M., Straubing H. Complex polynomials and circuit lower bounds for modular counting. Comput. Complexity. 4:1994;325-338.
-
(1994)
Comput. Complexity
, vol.4
, pp. 325-338
-
-
Barrington, D.M.1
Straubing, H.2
-
6
-
-
0009553114
-
Upper and lower bounds for some depth-3 circuit classes
-
IEEE Computer Society Press, Silver Spring, MD
-
R. Beigel, A. Maciel, Upper and lower bounds for some depth-3 circuit classes, in: Proceedings of the 12th IEEE Conference on Computational Complexity, IEEE Computer Society Press, Silver Spring, MD, 1997, pp. 149-157.
-
(1997)
Proceedings of the 12th IEEE Conference on Computational Complexity
, pp. 149-157
-
-
Beigel, R.1
Maciel, A.2
-
8
-
-
0024606088
-
With probability one, a random oracle separates PSPACE from the polynomial-time hierarchy
-
Cai J.-Y. With probability one, a random oracle separates PSPACE from the polynomial-time hierarchy. J. Comput. System Sci. 38:1989;68-85.
-
(1989)
J. Comput. System Sci.
, vol.38
, pp. 68-85
-
-
Cai, J.-Y.1
-
10
-
-
0002127588
-
Parity, circuits, and the polynomial-time hierarchy
-
Furst M., Saxe J.B., Sipser M. Parity, circuits, and the polynomial-time hierarchy. Math. Systems Theory. 17:1984;13-27.
-
(1984)
Math. Systems Theory
, vol.17
, pp. 13-27
-
-
Furst, M.1
Saxe, J.B.2
Sipser, M.3
-
11
-
-
0000632542
-
A note on the power of majority gates and modular gates
-
Goldmann M. A note on the power of majority gates and modular gates. Inform. Process. Lett. 53:1995;321-327.
-
(1995)
Inform. Process. Lett.
, vol.53
, pp. 321-327
-
-
Goldmann, M.1
-
12
-
-
0033417012
-
Exponential sums and circuits with a single threshold gate and mod-gates
-
Green F. Exponential sums and circuits with a single threshold gate and mod-gates. Theory Comput. Systems. 32:1999;453-466.
-
(1999)
Theory Comput. Systems
, vol.32
, pp. 453-466
-
-
Green, F.1
-
13
-
-
0034368817
-
A complex-number fourier method for lower bounds on the Mod-m degree
-
Green F. A complex-number fourier method for lower bounds on the Mod-m degree. Comput. Complexity. 9:2000;16-38.
-
(2000)
Comput. Complexity
, vol.9
, pp. 16-38
-
-
Green, F.1
-
14
-
-
0029324772
-
The power of the middle bit of a #P function
-
Green F., Köbler J., Regan K., Schwentick T., Torán J. The power of the middle bit of a #P function. J. Comput. System Sci. 50:1995;456-467.
-
(1995)
J. Comput. System Sci.
, vol.50
, pp. 456-467
-
-
Green, F.1
Köbler, J.2
Regan, K.3
Schwentick, T.4
Torán, J.5
-
16
-
-
0023576568
-
Threshold circuits of bounded depth
-
IEEE Computer Society Press, Silver Spring, MD
-
A. Hajnal, W. Maass, P. Pudlák, M. Szegedy, G. Turán, Threshold circuits of bounded depth, in: Proceedings of the 28th Annual IEEE Symposium on Foundations of Computer Science, IEEE Computer Society Press, Silver Spring, MD, 1987, pp. 99-110.
-
(1987)
Proceedings of the 28th Annual IEEE Symposium on Foundations of Computer Science
, pp. 99-110
-
-
Hajnal, A.1
Maass, W.2
Pudlák, P.3
Szegedy, M.4
Turán, G.5
-
18
-
-
0001295178
-
On the power of small-depth threshold circuits
-
Håstad J., Goldmann M. On the power of small-depth threshold circuits. Comput. Complexity. 1:1991;113-129.
-
(1991)
Comput. Complexity
, vol.1
, pp. 113-129
-
-
Håstad, J.1
Goldmann, M.2
-
19
-
-
0028115163
-
On the computational power of depth 2 circuits with threshold and modulo gates
-
ACM Press, New York
-
M. Krause, P. Pudlák, On the computational power of depth 2 circuits with threshold and modulo gates, in: Proceedings of the 26th Annual ACM Symposium on the Theory of Computing, ACM Press, New York, 1994, pp. 48-57.
-
(1994)
Proceedings of the 26th Annual ACM Symposium on the Theory of Computing
, pp. 48-57
-
-
Krause, M.1
Pudlák, P.2
-
21
-
-
0000883554
-
Lower bounds on the size of bounded depth networks over a complete basis with logical addition
-
Razborov A.A. Lower bounds on the size of bounded depth networks over a complete basis with logical addition. Mat. Zametki. 41:1987;598-607. (English translation in Math. Notes Acad. Sci. USSR 41 (1987) 333-338).
-
(1987)
Mat. Zametki
, vol.41
, pp. 598-607
-
-
Razborov, A.A.1
-
22
-
-
26944478724
-
-
English translation
-
Razborov A.A. Lower bounds on the size of bounded depth networks over a complete basis with logical addition. Mat. Zametki. 41:1987;598-607. (English translation in Math. Notes Acad. Sci. USSR 41 (1987) 333-338).
-
(1987)
Math. Notes Acad. Sci. USSR
, vol.41
, pp. 333-338
-
-
-
23
-
-
0028013942
-
Natural proofs
-
New York
-
A.A. Razborov, S. Rudich, Natural proofs, in: Proceedings of the 26th ACM Symposium on Theory of Computing, Association for Computing Machinery, New York, 1994, pp. 204-213.
-
(1994)
Proceedings of the 26th ACM Symposium on Theory of Computing, Association for Computing Machinery
, pp. 204-213
-
-
Razborov, A.A.1
Rudich, S.2
-
24
-
-
0003215121
-
Equations over finite fields: An elementary approach
-
New York: Springer
-
Schmidt W.M. Equations Over Finite Fields: an Elementary Approach. Lecture Notes in Mathematics. Vol. 536:1976;Springer, New York.
-
(1976)
Lecture Notes in Mathematics
, vol.536
-
-
Schmidt, W.M.1
-
26
-
-
0026239342
-
PP is as hard as the polynomial-time hierarchy
-
Toda S. PP is as hard as the polynomial-time hierarchy. SIAM J. Comput. 20:1991;865-877.
-
(1991)
SIAM J. Comput.
, vol.20
, pp. 865-877
-
-
Toda, S.1
|