Pages that link to "Item:Q1065546"
From MaRDI portal
The following pages link to Time-space tradeoffs for matrix multiplication and the discrete Fourier transform on any general sequential random-access computer (Q1065546):
Displaying 14 items.
- A note on the decoding complexity of error-correcting codes (Q845843) (← links)
- Time-space tradeoffs for algebraic problems on general sequential machines (Q1176102) (← links)
- Trade-offs between communication and space (Q1201877) (← links)
- The computational complexity of universal hashing (Q1208411) (← links)
- Time-space tradeoffs for set operations (Q1210542) (← links)
- Time-space tradeoffs in algebraic complexity theory (Q1977138) (← links)
- Tight time-space lower bounds for finding multiple collision pairs and their applications (Q2055617) (← links)
- On lower bounds for read-\(k\)-times branching programs (Q2366719) (← links)
- Time and space efficient generators for quasiseparable matrices (Q2409018) (← links)
- An \(\mathrm{Omega}((n \log n)/R)\) lower bound for Fourier transform computation in the \(R\)-well conditioned model (Q2828217) (← links)
- Throughput-Distortion Computation of Generic Matrix Multiplication: Toward a Computation Channel for Digital Signal Processing Systems (Q4573645) (← links)
- Upper and Lower Bounds on Time-Space Tradeoffs for Computations with Embedded Fast Fourier Transforms (Q4729344) (← links)
- Quadratic Time-Space Lower Bounds for Computing Natural Functions with a Random Oracle (Q5090435) (← links)
- Trade-offs between communication throughput and parallel time (Q5906374) (← links)
