The Linear Complexity of Computation

Authors:
Jacques Morgenstern
Affiliations:
Institut de Mathématiques et Sciences Physiques, Université de Nice Nice, France
Venue:
Journal of the ACM (JACM)
Year:
1975

Citing 1
Cited 4

Note on a Lower Bound on the Linear Complexity of the Fast Fourier Transform

Journal of the ACM (JACM)

Optimality of the Fast Fourier transform

Journal of the ACM (JACM)
Lower bounds on the bounded coefficient complexity of bilinear maps

Journal of the ACM (JACM)
Faster dimension reduction

Communications of the ACM
Min-rank conjecture for log-depth circuits

Journal of Computer and System Sciences

Quantified Score

Hi-index	0.02

Visualization

Abstract