Superpolynomial lower bounds for monotone span programs

Combinatorica

Volumn 19, Issue 3, 1999, Pages 301-319

  Babai, László ^a   Gál, Anna ^c   Wigderson, Avi ^b  

^a THE UNIVERSITY OF CHICAGO   (United States)

^b HEBREW UNIVERSITY OF JERUSALEM   (Israel)

^c University of Texas at Austin   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0040113669     PISSN: 02099683     EISSN: None     Source Type: Journal    
DOI: 10.1007/s004930050058     Document Type: Article

References (47)

1. N. ALON and R. BOPPANA: The monotone circuit complexity of Boolean functions, Combinatoria 7 (1987), 1-22.
2. E. ALLENDER, R. BEALS, M. OGIHARA: The complexity of matrix rank and feasible systems of linear equations, in: Proc. 28th ACM STOC, 1996, 161-167.
3. N. ALON, O. GOLDREICH, J. HÅSTAD, R. PERALTA: Simple constructions of almost k-wise independent random variables, Random Structures and Algorithms 3 (1992), 289-304.
4. Y. AZAR, R. MOTWANI, J. NAOR: Approximating probability distributions using small sample spaces, Combinatorica, 18(2) (1998), 151-171.
5. L. BABAI, P. FRANKL, J. SIMON: Complexity classes in communication complexity theory, in: Proc. 27th IEEE FOCS, 1986, 337-347.
6. L. BABAI, A. GÁL, J. KOLLÁR, L. RÓNYAI, T. SZABÓ, A. WIGDERSON: Extremal bipartite graphs and superpolynomial lower bounds for monotone span programs, in: Proc. 28th ACM STOC, 1996, 603-611.
7. A. BEIMEL, A. GÁL and M. PATERSON: Lower bounds for monotone span programs, Computational Complexity 6 (1996/97), 29-45. Preliminary version appeared in: Proc. 36th IEEE FOCS, 1995, 674-681.
8. A. BEIMEL, A. GÁL and M. PATERSON: Lower bounds for monotone span programs, Computational Complexity 6 (1996/97), 29-45. Preliminary version appeared in: Proc. 36th IEEE FOCS, 1995, 674-681.
9. S. J. BERKOWITZ: On computing the determinant in small parallel time using a small number of processors, Inform. Process. Lett., 18 (1984), 147-150.
10. B. BOLLOBÁS: Extremal Graph Theory, Academic Press, 1978.
11. G. BUNTROCK, C. DAMM, H. HERTRAMPF, and C. MEINEL: Structure and importance of the logspace-mod class, Math. System, Theory, 25 (1992), 223-237.
12. L. CSÁNKY: Fast parallel matrix inversion algorithms, SIAM J. of Computing, 5 (1976), 818-823.
13. L. CSIRMAZ: The dealer's random bits in perfect secret sharing schemes, Studia Sci. Math. Hungar., 32 (1996), no. 3-4, 429-437.
14. A. GÁL: A characterization of span program size and improved lower bounds for monotone span programs, in: Proc. 30th ACM STOC, 1998, 429-437.
15. P. GOLDBERG and M. JERRUM: Bounding the Vapnik-Chervonenkis dimension of concept classes parametrized by real numbers, Proc. 6th ACM COLT, 1993, 361-369.
16. R. L. GRAHAM, J. H. SPENCER: A constructive solution to a tournament problem, Canad. Math. Bull., 14 (1971), 45-48.
17. M. GRIGNI, M. SIPSER: Monotone complexity, in: Boolean junction complexity, edited by M. Paterson, London Math. Society Lecture Note Series, 169, Cambridge University Press, 1992, 57-75.
18. ARMIN HAKEN: Counting bottlenecks to show monotone P ≠ NP, in: Proc. 36th IEEE FOCS, Milwaukee WI 1995, 36-40.
19. B. KALYANASUNDARAM and G. SCHNITGER: The probabilistic communication complexity of set intersection, in: Proc. of Structure in Complexity Theory, 1987, 41-49.
20. M. KARCHMER: On proving lower bounds for circuit size, in: Proc. 8th Ann. Symp. Structure in Complexity Theory, IEEE 1993, 112-118.
21. M. KARCHMER and A. WIGDERSON: On span programs, in: Proc. 8th Ann. Symp. Structure in Complexity Theory, IEEE 1993, 102-111.
22. M. KARCHMER and A. WIGDERSON: Monotone circuits for connectivity require super-logarithmic depth, in: SIAM Journal on Discrete Mathematics, 3(2) (1990), 255-265.
23. J. KOLLÁR, L. RÓNYAI, T. SZABÓ: Norm-graphs and bipartite Turán numbers, Combinatorica, 16 (1996), 399-406.
24. L. LOVÁSZ: On determinants, matchings and random algorithms, Fundamentals of Computing Theory, Akademia-Verlag, Berlin, (1979).
25. R. LIDL, H. NIEDERREITER: Introduction to Finite Fields and their Applications, Cambridge University Press, 1986.
26. J. MILNOR: On the Betti numbers of real varieties, Proc. Amer. Math. Soc., 15 (1964), 275-280.
27. K. MULMULEY: A fast parallel algorithm to compute the rank of a matrix over an arbitrary field, Combinatorica, 7 (1987), 101-104.
28. A. O. OLEǏNIK; Estimates of the Betti numbers of real algebraic hypersurfaces, Mat. Sbornik (N. S.) 28 (1951), 635-640 (in Russian).
29. A. O. OLEǏNIK, I. B. PETROVSKIǏ: On the topology of real algebraic surfaces, Izv. Akad. Nauk SSSR, 13 (1949), 389-402 (in Russian). (Transl. Amer. Math. Soc., 7 (1962), 399-417.)
30. A. O. OLEǏNIK, I. B. PETROVSKIǏ: On the topology of real algebraic surfaces, Izv. Akad. Nauk SSSR, 13 (1949), 389-402 (in Russian). (Transl. Amer. Math. Soc., 7 (1962), 399-417.)
31. P. PUDLÁK and V. RÖDL: A combinatorial approach to complexity, Combinatorica, 12 (1992), 221-226.
32. R. RAZ and A. WIGDERSON: Monotone circuits for matching require linear depth, Journal of the ACM, 39, 1992, 736-744.
33. A. A. RAZBOROV: Lower bounds for the monotone complexity of some Boolean functions, Soviet Math. Doklady, 31 (1985), 354-357.
34. A. A. RAZBOROV: A lower bound on the monotone network complexity of the logical permanent, Mat. Zametki, 37 (1985), 887-900.
35. A. A. RAZBOROV: On the method of approximation, in: Proc. 21st ACM STOC, 1989, 167-176.
36. A. A. RAZBOROV: On the distributional complexity of disjointness, Theoretical Computer Science, 106 1992, No. 2, 385-390.
37. W. M. SCHMIDT: Equations over Finite Fields: An Elementary Approach, Lect. Notes in Math. vol. 536, Springer Verlag, 1976.
38. J. T. SCHWARTZ: Fast probabilistic algorithms for verification of polynomial identities, JACM, 27(4), (1980), 701-717.
39. S. SKYUM, L. G. VALIANT: A complexity theory based on Boolean algebra, JACM, 32(2), (1985), 484-502.
40. D. R. STINSON: An explicitation of secret sharing schemes, Design, Codes and Cryptography, 2 (1992), 357-390.
41. É. TARDOS: The gap between monotone and non-monotone circuit complexity is exponential, Combinatorica, 7(4), (1987), 141-142.
42. R. THOM: Sur l'homologie des variétés algébriques réelles, in: Differential and Combinatorial Topology (Stewart S. Cairns, ed.), Princeton University Press, 1965.
43. W. T. TUTTE: The factorization of linear graphs, J. London Math. Soc., 22 (1947), 107-111.
44. H. E. WARREN: Lower bounds for approximation by non-linear manifolds, Trans. Amer. Math. Soc., 133 (1968), 167-178.
45. I. WEGENER: The Complexity of Boolean Functions, Wiley-Teubner 1987.
46. A. WIGDERSON: The fusion method for lower bounds in circuit complexity, in: Combinatorics, Paul Erdös is Eighty, (Volume 1), D. Miklós, V. T. Sós, T. Szönyi, eds., Bolyai Society Mathematical Studies 1, Budapest 1993, 453-467.
47. R. E. ZIPPEL: Probabilistic algorithms for sparse polynomials, in: Proc. of EUROSAM 79, volume 72 of Lecture Notes in Comp. Sci., 1979, 216-226.