A lower bound for depth-3 circuits with MOD m gates

Information Processing Letters

Volumn 67, Issue 2, 1998, Pages 87-90

  Grolmusz, Vince ^a  

^a EÖTVÖS LORÁND UNIVERSITY   (Hungary)

Author keywords

Circuit complexity; Communication complexity; Complexity of finite functions; Composite moduli; Computational complexity; Randomized algorithms

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; FINITE AUTOMATA; LOGIC GATES;

CIRCUIT COMPLEXITY;

LOGIC CIRCUITS;

EID: 0032115195     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/s0020-0190(98)00093-3     Document Type: Article

References (24)

1. 1 formulae on finite structures, Ann. Pure Appl. Logic 24 (1983) 1-48.
2. 1, in: Proc. 18th Ann. ACM Symp. Theory Comput., 1986, pp. 1-5; also: J. Comput. Syst. Sci. 38 (1989).
3. 1, in: Proc. 18th Ann. ACM Symp. Theory Comput., 1986, pp. 1-5; also: J. Comput. Syst. Sci. 38 (1989).
4. D.A.M. Barrington, R. Beigel, S. Rudich, Representing Boolean functions as polynomials modulo composite numbers, Comput. Complexity 4 (1994) 367-382. Appeared also in Proc. 24th Ann. ACM Symp. Theory Comput., 1992.
5. D.A.M. Barrington, R. Beigel, S. Rudich, Representing Boolean functions as polynomials modulo composite numbers, Comput. Complexity 4 (1994) 367-382. Appeared also in Proc. 24th Ann. ACM Symp. Theory Comput., 1992.
6. D.A.M. Barrington, H. Straubing, D. Thérien, Non-uniform automata over groups, Inform, and Computation 89 (1990) 109-132.
7. R. Beigel, J. Tarui, On ACC, in: Proc. 32nd Ann. IEEE Symp. Found. Comput. Sci., 1991, pp. 783-792.
8. H. Caussinus, A note on a theorem of Barrington, Straubing and Thérien, Inform. Process. Lett. 58 (1996) 31-33.
9. B. Chor, O. Goldreich, Unbiased bits from sources of weak randomness and probabilistic communication complexity, in: Proc. 26th Ann. IEEE Symp. Found. Comput. Sci., 1985, pp. 429-442; also: SIAM J. Comput. 17 (1988).
10. B. Chor, O. Goldreich, Unbiased bits from sources of weak randomness and probabilistic communication complexity, in: Proc. 26th Ann. IEEE Symp. Found. Comput. Sci., 1985, pp. 429-442; also: SIAM J. Comput. 17 (1988).
11. M.L. Furst, J.B. Saxe, M. Sipser, Parity, circuits and the polynomial time hierarchy, Math. Systems Theory 17 (1984) 13-27.
12. M. Goldmann, J. Håstad, A. Razborov, Majority gates vs. general weighted threshold gates, Comput. Complexity 2 (1992) 277-300.
13. V. Grolmusz, Separating the communication complexities of MOD m and MOD p circuits, J. Comput. Syst. Sci. 51 (2) (1995) 307-313. Also in: Proc. 33rd Ann. IEEE Symp. Found. Comput. Sci., 1992, pp. 278-287.
14. V. Grolmusz, Separating the communication complexities of MOD m and MOD p circuits, J. Comput. Syst. Sci. 51 (2) (1995) 307-313. Also in: Proc. 33rd Ann. IEEE Symp. Found. Comput. Sci., 1992, pp. 278-287.
15. A. Hajnal, W. Maass, P. Pudlak, M. Szegedy, G. Turán, Threshold circuits of bounded depth, in: Proc. 28th Ann. IEEE Symp. Found. Comput. Sci., 1987, pp. 99-110; also: J. Comput. Syst. Sci. 46 (1993).
16. A. Hajnal, W. Maass, P. Pudlak, M. Szegedy, G. Turán, Threshold circuits of bounded depth, in: Proc. 28th Ann. IEEE Symp. Found. Comput. Sci., 1987, pp. 99-110; also: J. Comput. Syst. Sci. 46 (1993).
17. J. Håstad, Almost optimal lower bounds for small depth circuits, in: Proc. 18th Ann. ACM Symp. Theory Comput., 1986, pp. 6-20,
18. M. Krause, S. Waack, Variation ranks of communication matrices and lower bounds for depth-two circuits having nearly symmetric gates with unbounded fan-in, Mathematical Systems Theory 28 (6) (1995) 553-564.
19. N. Nisan, The communication complexity of threshold gates, in: V.S.D. Miklós, T. Szõnyi (Eds.), Combinatorics, Paul Erdõs is Eighty, Vol. I, János Bolyai Mathematical Society, Budapest, 1993, pp. 301-315.
20. A. Razborov, Lower bounds on the size of bounded depth networks over a complete basis with logical addition, Mat. Zametki 41 (1987) 598-607 (in Russian).
21. R. Smolensky, Algebraic methods in the theory of lower bounds for Boolean circuit complexity, in: Proc. 19th Ann. ACM Symp. Theory Comput., 1987, pp. 77-82.
22. A.C. Yao, Some complexity questions related to distributed computing, in: Proc. 11th Ann. ACM Symp. Theory Comput., 1979, pp. 209-213.
23. A.C. Yao, Separating the polynomial-time hierarchy by oracles, in: Proc. 26th Ann. IEEE Symp. Found. Comput. Sci., 1985, pp. 1-10.
24. A.C. Yao, On ACC and threshold circuits, in: Proc. 31st Ann. IEEE Symp. Found. Comput. Sci., 1990, pp. 619-627.