-
1
-
-
0002970176
-
1-formulae on finite structures
-
1-formulae on finite structures, Ann. Pure Appl. Logic, 24 (1983), pp. 1-48.
-
(1983)
Ann. Pure Appl. Logic
, vol.24
, pp. 1-48
-
-
Ajtai, M.1
-
3
-
-
84948129558
-
Upper bounds on multiparty communication complexity of shifts
-
Springer, Berlin
-
A. Ambainis, Upper bounds on multiparty communication complexity of shifts, in Proceedings of the 13th Annual Symposium on Theoretical Aspects of Computer Science, Lecture Notes in Comput. Sci. 1046, Springer, Berlin, 1996, pp. 631-642.
-
(1996)
Proceedings of the 13th Annual Symposium on Theoretical Aspects of Computer Science, Lecture Notes in Comput. Sci. 1046
, pp. 631-642
-
-
Ambainis, A.1
-
4
-
-
84896692804
-
Improved upper bounds on simultaneous messages complexity
-
Springer, Berlin
-
A. Ambainis and S. V. Lokam, Improved upper bounds on simultaneous messages complexity, in Proceedings of LATIN 2000, Lecture Notes in Comput. Sci. 1776, Springer, Berlin, 2000, pp. 207-216.
-
(2000)
Proceedings of LATIN 2000, Lecture Notes in Comput. Sci. 1776
, pp. 207-216
-
-
Ambainis, A.1
Lokam, S.V.2
-
5
-
-
0040553020
-
Representation of group elements as short products
-
L. Babai and P. Erdös, Representation of group elements as short products, Ann. Discrete Math., 12 (1982), pp. 21-26.
-
(1982)
Ann. Discrete Math.
, vol.12
, pp. 21-26
-
-
Babai, L.1
Erdös, P.2
-
6
-
-
0039304089
-
The cost of the missing bit: Communication complexity with help
-
L. Babai, T. Hayes and P. Kimmel, The cost of the missing bit: Communication complexity with help, Combinatorica, 21 (2001), pp. 455-488.
-
(2001)
Combinatorica
, vol.21
, pp. 455-488
-
-
Babai, L.1
Hayes, T.2
Kimmel, P.3
-
7
-
-
21844513803
-
Simultaneous messages vs. communication
-
Springer, Berlin
-
L. Babai, P. Kimmel, and S. V. Lokam, Simultaneous messages vs. communication, in Proceedings of the 12th Annual Symposium on Theoretical Aspects of Computer Science, Lecture Notes in Comput. Sci. 900, Springer, Berlin, 1995, pp. 361-372.
-
(1995)
Proceedings of the 12th Annual Symposium on Theoretical Aspects of Computer Science, Lecture Notes in Comput. Sci. 900
, pp. 361-372
-
-
Babai, L.1
Kimmel, P.2
Lokam, S.V.3
-
8
-
-
0026940019
-
Multiparty protocols, pseudorandom generators for logspace and time-space trade-offs
-
L. Babai, N. Nisan, and M. Szegedy, Multiparty protocols, pseudorandom generators for logspace and time-space trade-offs, J. Comput. System Sci., 45 (1992), pp. 204-232.
-
(1992)
J. Comput. System Sci.
, vol.45
, pp. 204-232
-
-
Babai, L.1
Nisan, N.2
Szegedy, M.3
-
9
-
-
0026400777
-
On ACC
-
R. Beigel and J. Tarui, On ACC, in Proceedings of the 32nd Annual IEEE Symposium on Foundations of Computer Science, San Juan, PR, 1991, pp. 783-792.
-
Proceedings of the 32nd Annual IEEE Symposium on Foundations of Computer Science, San Juan, PR, 1991
, pp. 783-792
-
-
Beigel, R.1
Tarui, J.2
-
10
-
-
0036287241
-
Information theory methods in communication complexity
-
Z. Bar-Yossef, T. S. Jayram, R. Kumar and D. Sivakumar, Information theory methods in communication complexity, in Proceedings of the 17th IEEE Conference on Computational Complexity, Montreal, QB, Canada, 2002, pp. 72-81.
-
Proceedings of the 17th IEEE Conference on Computational Complexity, Montreal, QB, Canada, 2002
, pp. 72-81
-
-
Bar-Yossef, Z.1
Jayram, T.S.2
Kumar, R.3
Sivakumar, D.4
-
12
-
-
0020949869
-
Multiparty protocols
-
A. K. Chandra, M. L. Furst, and R. J. Lipton, Multiparty protocols, in Proceedings of the 15th Annual ACM Symposium on Theory of Computing, Boston, MA, 1983, pp. 94-99.
-
(1983)
Proceedings of the 15th Annual ACM Symposium on Theory of Computing, Boston, MA
, pp. 94-99
-
-
Chandra, A.K.1
Furst, M.L.2
Lipton, R.J.3
-
14
-
-
85025485196
-
On sparse graphs with dense long paths
-
P. Erdöos, R. Grahan, and E. Szemerédi, On sparse graphs with dense long paths, Comp. and Maths. with Appls., 1 (1975), pp. 365-369.
-
(1975)
Comp. and Maths. with Appls.
, vol.1
, pp. 365-369
-
-
Erdöos, P.1
Grahan, R.2
Szemerédi, E.3
-
15
-
-
0002127588
-
Parity, circuits, and the polynomial time hierarchy
-
M. Furst, J. Saxe, and M. Sipser, Parity, circuits, and the polynomial time hierarchy, Math. Systems Theory, 17 (1984), pp. 13-27.
-
(1984)
Math. Systems Theory
, vol.17
, pp. 13-27
-
-
Furst, M.1
Saxe, J.2
Sipser, M.3
-
16
-
-
38149146834
-
The BNS lower bound for multi-party protocols is nearly optimal
-
V. Grolmusz, The BNS lower bound for multi-party protocols is nearly optimal, Inform. and Comput., 112 (1994), pp. 51-54.
-
(1994)
Inform. and Comput.
, vol.112
, pp. 51-54
-
-
Grolmusz, V.1
-
17
-
-
0001295178
-
On the power of small-depth threshold circuits
-
J. Håstad and M. Goldmann, On the power of small-depth threshold circuits, Comput. Complexity, 1 (1991), pp. 113-129.
-
(1991)
Comput. Complexity
, vol.1
, pp. 113-129
-
-
Håstad, J.1
Goldmann, M.2
-
18
-
-
0023576568
-
Threshold circuits of bounded depth
-
A. Hajnal, W. Maass, P. Pudlák, M. Szegedy, and G. Turán, Threshold circuits of bounded depth, in Proceedings of the 28th Annual IEEE Symposium on Foundations of Computer Science, Los Angeles, CA, 1987, pp. 99-110.
-
Proceedings of the 28th Annual IEEE Symposium on Foundations of Computer Science, Los Angeles, CA, 1987
, pp. 99-110
-
-
Hajnal, A.1
Maass, W.2
Pudlák, P.3
Szegedy, M.4
Turán, G.5
-
19
-
-
0033720713
-
On the efficiency of local decoding procedures for error-correcting codes
-
J. Katz and L. Trevisan, On the efficiency of local decoding procedures for error-correcting codes, in Proceedings of the 32nd ACM Symposium on Theory of Computing, Partland, OR, 2000, pp. 80-86.
-
Proceedings of the 32nd ACM Symposium on Theory of Computing, Portland, OR, 2000
, pp. 80-86
-
-
Katz, J.1
Trevisan, L.2
-
20
-
-
0039363674
-
On H-bases and H-decompositions of finite solvable and alternating groups
-
G. Kozma and A. Lev, On H-bases and H-decompositions of finite solvable and alternating groups, J. Number Theory, 49 (1994), 385-391.
-
(1994)
J. Number Theory
, vol.49
, pp. 385-391
-
-
Kozma, G.1
Lev, A.2
-
23
-
-
0003625461
-
Private access to distributed information
-
Masters thesis, Technion, Haifa, Israel
-
E. Mann, Private Access to Distributed Information, Masters thesis, Technion, Haifa, Israel, 1998.
-
(1998)
-
-
Mann, E.1
-
24
-
-
38149074447
-
The computational complexity of universal hashing
-
Y. Mansour, N. Nisan, and P. Tiwari, The computational complexity of universal hashing, Theoret. Comput. Sci., 107 (1993), pp. 121-133.
-
(1993)
Theoret. Comput. Sci.
, vol.107
, pp. 121-133
-
-
Mansour, Y.1
Nisan, N.2
Tiwari, P.3
-
25
-
-
0027543090
-
Rounds in communication complexity revisited
-
N. Nisan and A. Wigderson, Rounds in communication complexity revisited, SIAM J. Comput., 22 (1993), pp. 211-219.
-
(1993)
SIAM J. Comput.
, vol.22
, pp. 211-219
-
-
Nisan, N.1
Wigderson, A.2
-
26
-
-
0027308412
-
Modified ranks of tensors and the size of circuits
-
P. Pudlák and V. Rödl, Modified ranks of tensors and the size of circuits, in Proceedings of the 25th Annual ACM Symposium on Theory of Computing, San Diego, CA, 1993, pp. 523-531.
-
Proceedings of the 25th Annual ACM Symposium on Theory of Computing, San Diego, CA, 1993
, pp. 523-531
-
-
Pudlák, P.1
Rödl, V.2
-
27
-
-
0000362179
-
Boolean circuits, tensor ranks, and communication complexity
-
P. Pudlák, V. Rödl, and J. Sgall, Boolean circuits, tensor ranks, and communication complexity, SIAM J. Comput., 26 (1997), pp. 605-633.
-
(1997)
SIAM J. Comput.
, vol.26
, pp. 605-633
-
-
Pudlák, P.1
Rödl, V.2
Sgall, J.3
-
28
-
-
26744471682
-
On the rohrbach conjecture
-
private communication
-
L. Pyber, On the Rohrbach Conjecture, private communication.
-
-
-
Pyber, L.1
-
29
-
-
0000347859
-
Ω(log n) lower bounds on the size of depth 3 circuits with AND gates at the bottom
-
Ω(log n) lower bounds on the size of depth 3 circuits with AND gates at the bottom, Inform. Process. Lett., 45 (1993), pp. 303-307.
-
(1993)
Inform. Process. Lett.
, vol.45
, pp. 303-307
-
-
Razborov, A.1
Wigderson, A.2
-
30
-
-
34250973727
-
Ein Beitrag zur additiven Zahlentheorie, Math. Z.
-
H. Rohrbach, Ein Beitrag zur additiven Zahlentheorie, Math. Z., 42 (1937), pp. 1-30.
-
(1937)
, vol.42
, pp. 1-30
-
-
Rohrbach, H.1
-
31
-
-
0040549010
-
Anwendung eines Satzes der additiven Zahlentheorie auf eine gruppentheoretische Frage
-
H. Rohrbach, Anwendung eines Satzes der additiven Zahlentheorie auf eine gruppentheoretische Frage, Math. Z., 42 (1937), pp. 538-542.
-
(1937)
Math. Z.
, vol.42
, pp. 538-542
-
-
Rohrbach, H.1
-
32
-
-
0003215121
-
Equations over finite fields: An elementary approach
-
Springer, Berlin
-
W. M. Schmidt, Equations over Finite Fields: An Elementary Approach, Lecture Notes in Math. 536, Springer, Berlin, 1976.
-
(1976)
Lecture Notes in Math.
, vol.536
-
-
Schmidt, W.M.1
-
33
-
-
85016972944
-
Graph-theoretic arguments in low-level complexity
-
Springer, Berlin
-
L. Valiant, Graph-theoretic arguments in low-level complexity, in Proceedings of 6th Symposium on Mathematical Foundations on Computer Science, Lecture Notes in Comput. Sci. 53, Springer, Berlin, 1977, pp. 162-176.
-
(1977)
Proceedings of 6th Symposium on Mathematical Foundations on Computer Science, Lecture Notes in Comput. Sci. 53
, pp. 162-176
-
-
Valiant, L.1
-
34
-
-
0020909669
-
Lower bounds of probabilistic arguments
-
A. C.-C. Yao, Lower bounds of probabilistic arguments, in Proceedings of the 24th Annual IEEE Symposium on Foundations of Computer Science, Tucson, AZ, 1983, pp. 420-428.
-
Proceedings of the 24th Annual IEEE Symposium on Foundations of Computer Science, Tucson, AZ, 1983
, pp. 420-428
-
-
Yao, A.C.-C.1
-
35
-
-
0025563973
-
On ACC and threshold circuits
-
A. C.-C. Yao, On ACC and threshold circuits, in Proceedings of the 31st Annual IEEE Symposium on Foundations of Computer Science, St. Louis, MO, 1990, pp. 619-627.
-
Proceedings of the 31st Annual IEEE Symposium on Foundations of Computer Science, St. Louis, MO, 1990
, pp. 619-627
-
-
Yao, A.C.-C.1
|