scientific article; zbMATH DE number 3628386
From MaRDI portal
Publication:4190139
zbMath0404.68050MaRDI QIDQ4190139
Sowmitri Swamy, John E. Savage
Publication date: 1979
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Computational ComplexityPebBle GameRandom-Access MachineSpace-Time Tradeoffs for Oblivious Integer MultiplicationStraight-Line Algorithms
Related Items (12)
Space-time tradeoffs for linear recursion ⋮ Static-memory-hard functions, and modeling the cost of space vs. time ⋮ Time-space efficient algorithms for computing convolutions and related problems ⋮ Upper bounds for time-space trade-offs in sorting and selection ⋮ Time-space tradeoffs for algebraic problems on general sequential machines ⋮ Time-space tradeoffs in algebraic complexity theory ⋮ On Reducing the Space Requirements of a Straight-Line Algorithm ⋮ Nullstellensatz size-degree trade-offs from reversible pebbling ⋮ Nullstellensatz size-degree trade-offs from reversible pebbling ⋮ Lower bounds in algebraic computational complexity ⋮ The performance of multilective VLSI algorithms ⋮ Depth-Robust Graphs and Their Cumulative Memory Complexity
This page was built for publication:
