On the complexity of bilinear forms: dedicated to the memory of Jacques Morgenstern

Authors:
Noam Nisan;Avi Wigderson
Affiliations:
Institute of Computer Science, Hebrew University of Jerusalem, Israel;Institute of Computer Science, Hebrew University of Jerusalem, Israel
Venue:
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Year:
1995

Citing 7
Cited 4

Meanders and their applications in lower bounds arguments

Journal of Computer and System Sciences - 27th IEEE Conference on Foundations of Computer Science October 27-29, 1986
The algebraic eigenvalue problem

The algebraic eigenvalue problem
Expanders that beat the eigenvalue bound: explicit construction and applications

STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Note on a Lower Bound on the Linear Complexity of the Fast Fourier Transform

Journal of the ACM (JACM)
Fast Probabilistic Algorithms for Verification of Polynomial Identities

Journal of the ACM (JACM)
How to compute fast a function and all its derivatives: a variation on the theorem of Baur-strassen

ACM SIGACT News
Superconcentrators, generalizers and generalized connectors with limited depth

STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing

On the complexity of matrix product

STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Lower bounds on the bounded coefficient complexity of bilinear maps

Journal of the ACM (JACM)
Elusive functions and lower bounds for arithmetic circuits

STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Complexity Lower Bounds using Linear Algebra

Foundations and Trends® in Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract