scientific article; zbMATH DE number 3628386

MaRDI QIDQ4190139zbMATH OpenFDO

Authors Sowmitri Swamy, John Savage

Publication date 1979

zbMATH Keywords

Computational ComplexityPebBle GameRandom-Access MachineSpace-Time Tradeoffs for Oblivious Integer MultiplicationStraight-Line Algorithms

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Cited in

(12)

• Lower bounds in algebraic computational complexity
• The performance of multilective VLSI algorithms
• 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
• Static-memory-hard functions, and modeling the cost of space vs. time
• Time-space tradeoffs in algebraic complexity theory
• Nullstellensatz size-degree trade-offs from reversible pebbling
• On Reducing the Space Requirements of a Straight-Line Algorithm
• Space-time tradeoffs for linear recursion
• Nullstellensatz size-degree trade-offs from reversible pebbling
• Depth-robust graphs and their cumulative memory complexity

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4190139)