Affine projections of symmetric polynomials

Journal of Computer and System Sciences

Volumn 65, Issue 4, 2002, Pages 639-659

  Shpilka, Amir ^a,b,c  

^a HEBREW UNIVERSITY OF JERUSALEM   (Israel)

^b HARVARD UNIVERSITY   (United States)

^c MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTER SIMULATION; FUNCTIONS; MATHEMATICAL MODELS; MATRIX ALGEBRA; OPTIMIZATION; PROBLEM SOLVING; SPECTRUM ANALYSIS;

AFFINE PROJECTIONS; LINEAR FUNCTIONS; LOWER BOUNDS; SYMMETRIC POLYNOMIALS;

POLYNOMIALS;

EID: 23844555879     PISSN: 00220000     EISSN: 10902724     Source Type: Journal    
DOI: 10.1016/S0022-0000(02)00021-1     Document Type: Conference Paper

References (30)

1. 1-formulae on finite structures, Ann. Pure Appl. Logic 24 (1982) 1-48.
2. N. Alon, R.B. Boppana, The monotone circuit complexity of boolean functions, Combinatorica 7 (1) (1987) 1-22.
3. W. Baur, V. Strassen, The complexity of partial derivatives, Theoret. Comput. Sci. 22 (1983) 317-330.
4. M. Ben-Or, private communication.
5. R. Ehrenborg, G.C. Rota, Apolarity and canonical forms for homogeneous polynomials, European J. Combin. 14(1993) 157-181.
6. M. Furst, J. Saxe, M. Sipser, Parity, circuits and the polynomial-time hierarchy, Math. Systems Theory 17 (1984) 13-27.
7. D. Grigoriev, M. Karpinski, An exponential lower bound for depth 3 arithmetic circuits, in: Proceedings of the 30th Annual ACM Symposium on the Theory of Computing, Dallas, TX, USA, May 23-26, 1998, pp. 577-582.
8. D. Grigoriev, A.A. Razborov, Exponential complexity lower bounds for depth 3 arithmetic circuits in algebras of functions over finite fields, Appl. Algebra Engng. Comm. Comput. 10 (6) (2000) 465-487.
9. A. Hajnal, W. Maass, P. Pudlák, M. Szegedy, G. Turán, Threshold circuits of bounded depth, J. Comput. System Sci. 46 (2) (1993) 129-154.
10. J. Håstad, Almost optimal lower bounds for small depth circuits, in: Proceedings of the 18th Annual ACM Symposium on Theory of Computing, Berkeley, California, May 28-30, 1986, pp. 28-30.
11. R. Impagliazzo, R. Paturi, M. Saks, Size-depth trade-offs for threshold circuits, SIAM J. Comput. 26 (1997) 693-707.
12. N. Nisan, Lower bounds for non-commutative computation, in: Proceedings of the 23rd Annual ACM Symposium on the Theory of Computing, New Orleans, LS, May 1991, ACM Press, New York, pp. 410-418.
13. N. Nisan, A. Wigderson, Lower bound on arithmetic circuits via partial derivatives, Comput. Complexity 6 (1996) 217-234.
14. P. Pudlak, Communication in bounded depth circuits, Combinatorica 14 (2) (1994) 203-216.
15. 2(x) and extensions of the Graham-Pollack theorem, 20th Conference on the Foundations of Software Technology and Theoretical Computer Science (FSTTCS), New Delhi, India, December 13-15, 2000, pp. 176-187.
16. R. Raz, A. Shpilka, Lower bounds for matrix product, in bounded depth circuits with arbitrary gates, in: 33rd Annual ACM Symposium on Theory of Computing, Crete, Greece, July 6-8, 2001, pp. 409-418.
17. A.A. Razborov, Lower bounds on the monotone complexity of some boolean functions, Dokl. Akad. Nauk. SSSR 281 (4) (1985) 798-801 (in Russian).
18. A.A. Razborov, Lower bounds for the size of circuits with bounded depth with basis {∧, ⊕}, Mathematical Notes of the Academy of Sciences of the USSR 41 (4) (1987) 333-338.
19. B.E. Sagan, Symmetric Group: Representations, Combinatorial Algorithms, and Symmetric Functions, Chapman & Hall, London, 1991.
20. M. Saks, private communication.
21. C.P. Schnorr, A lower bound on the number of additions in monotone computations, Theoret. Comput. Sci. 2 (1976) 305-315.
22. E. Shamir, M. Snir, Lower bounds on the number of multiplications and the number of additions in monotone computations, Technical Report RC-6757, IBM, 1977.
23. A. Shpilka, A. Wigderson, Depth-3 arithmetic circuits over fields of characteristic zero, Comput. Complexity 10 (1) (2001) 1-27.
24. R. Smolensky, Algebraic methods in the theory of lower bounds for Boolean circuit complexity, in: Proceedings of the 19th Annual ACM Symposium of Theory of Computing, New York, 25-27 May, 1987, pp. 77-82.
25. V. Strassen, Die berechnungskomplexiät von elementarsymmetrischen funktionen und von interpolationskoeffizienten, Numer. Math. 20 (1973) 238-251.
26. L.G. Valiant, Completeness classes in algebra, in: Conference Record of the 11th Annual ACM Symposium on Theory of Computing, Atlanta, Georgia, 30 April-2 May, 1979, pp. 249-261.
27. L.G. Valiant, The complexity of computing the permanent, Theoret. Comput. Sci. 8 (1979) 189-201.
28. L.G. Valiant, Reducibility by algebraic projections, Logic and Algorithms. L' Ènsignment Math. 30 (1982) 365-380.
29. A.C. Yao, Separating the polynomial-time hierarchy by oracles, in: 26th Annual Symposium on Foundations of Computer Science, Portland, Oregon, 21-23 October, 1985, pp. 1-10.
30. A.C. Yao, On ACC and threshold circuits, in: 31st Annual Symposium on Foundations of Computer Science, Vol. II, St. Louis, Missouri, 22-24 October, 1990, pp. 619-627.