Time-space tradeoffs for matrix multiplication and the discrete Fourier transform on any general sequential random-access computer
From MaRDI portal
Publication:1065546
DOI10.1016/0022-0000(84)90029-1zbMath0577.68060MaRDI QIDQ1065546
Publication date: 1984
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0022-0000(84)90029-1
68Q25: Analysis of algorithms and problem complexity
Related Items
Trade-offs between communication throughput and parallel time, Time-space tradeoffs for algebraic problems on general sequential machines, Trade-offs between communication and space, The computational complexity of universal hashing, Time-space tradeoffs for set operations, Time-space tradeoffs in algebraic complexity theory, On lower bounds for read-\(k\)-times branching programs