On Reducing the Space Requirements of a Straight-Line Algorithm
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 3940742
- scientific article; zbMATH DE number 1333612
- Rounds versus time for the two person pebble game (extended abstract)
- Time-space tradeoffs for computing functions, using connectivity properties of their circuits
- Time-space tradeoffs in algebraic complexity theory
Cites work
- A Time-Space Trade-Off
- Asymptotically tight bounds on time-space trade-offs in a pebble game
- Extreme time-space tradeoffs for graphs with small space requirements
- scientific article; zbMATH DE number 3521893 (Why is no real title available?)
- scientific article; zbMATH DE number 3614810 (Why is no real title available?)
- scientific article; zbMATH DE number 3628386 (Why is no real title available?)
- On Time Versus Space
- Space bounds for a game on graphs
- Space-time trade-offs on the FFT algorithm
- Space-time tradeoffs for linear recursion
- Time-space trade-offs in a pebble game
- Time-space tradeoffs for computing functions, using connectivity properties of their circuits
- Two Familiar Transitive Closure Algorithms Which Admit No Polynomial Time, Sublinear Space Implementations
Cited in
(4)
This page was built for publication: On Reducing the Space Requirements of a Straight-Line Algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3332245)
