The Linear Complexity of Computation

DOI10.1145/321879.321881zbMath0322.68025OpenAlexW2150409065MaRDI QIDQ4085240

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

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

Related Items (5)

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

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