The Linear Complexity of Computation

DOI10.1145/321879.321881MaRDI QIDQ4085240zbMATH OpenOpenAlexFDO

Authors Jacques Morgenstern

Publication date 1975

Published in Journal of the ACM (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/321879.321881

Mathematics Subject Classification ID

Direct numerical methods for linear systems and matrix inversion (65F05) Analysis of algorithms and problem complexity (68Q25)

Cited in

(6)

• Matrix rigidity
• Quick-means: accelerating inference for K-means by learning fast transforms
• A note on the use of determinant for proving lower bounds on the size of linear circuits
• Min-rank conjecture for log-depth circuits
• Towards automated generation of fast and accurate algorithms for recursive matrix multiplication
• Entropy of operators or why matrix multiplication is hard for depth-two circuits

This page was built for publication: The Linear Complexity of Computation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4085240)