Extremal bipartite graphs and superpolynomial lower bounds for monotone span programs

Authors:
László Babai;Anna Gál;János Kollár;Lajos Rónyai;Tibor Szabó;Avi Wigderson
Affiliations:
Department of Computer Science, University of Chicago, Chicago, IL;Institute for Advanced Study, Princeton, NJ;Department of Mathematics, University of Utah, Salt Lake City, UT;Computer and Automation Institute, Hungarian Academy of Sciences, Budapest, Lágymányosi u. 11, Hungary H-1111;Department of Mathematics, The Ohio State University, Columbus, Ohio;Institute of Computer Science, Hebrew University, Jerusalem, Israel
Venue:
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Year:
1996

Citing 13
Cited 7

On computing the determinant in small parallel time using a small number of processors

Information Processing Letters
Introduction to finite fields and their applications

Introduction to finite fields and their applications
The monotone circuit complexity of Boolean functions

Combinatorica
A fast parallel algorithm to compute the rank of a matrix over an arbitrary field

Combinatorica
The complexity of Boolean functions

The complexity of Boolean functions
On the method of approximations

STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Monotone circuits for matching require linear depth

Journal of the ACM (JACM)
On the distributional complexity of disjointness

Theoretical Computer Science
An explication of secret sharing schemes

Designs, Codes and Cryptography
Multiparty protocols, pseudorandom generators for logspace, and time-space trade-offs

Journal of Computer and System Sciences
Basic algebraic geometry 1 (2nd, revised and expanded ed.)

Basic algebraic geometry 1 (2nd, revised and expanded ed.)
Counting bottlenecks to show monotone P ? NP

FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
Lower bounds for monotone span programs

FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science

A characterization of span program size and improved lower bounds for monotone span programs

STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
On perfectly secure communication over arbitrary networks

Proceedings of the twenty-first annual symposium on Principles of distributed computing
On the spectrum of projective norm-graphs

Information Processing Letters
A characterization of span program size and improved lower bounds for monotone span programs

Computational Complexity
A note on monotone complexity and the rank of matrices

Information Processing Letters
Binary Covering Arrays and Existentially Closed Graphs

IWCC '09 Proceedings of the 2nd International Workshop on Coding and Cryptology
A result on the distribution of quadratic residues with applications to elliptic curve cryptography

INDOCRYPT'07 Proceedings of the cryptology 8th international conference on Progress in cryptology

Quantified Score

Hi-index	0.00

Visualization

Abstract