Size-space tradeoffs for oblivious computations

DOI10.1016/0022-0000(83)90021-1zbMath0515.68043OpenAlexW1985880793MaRDI QIDQ1052095

John E. Savage, David A. Carlson

Publication date: 1983

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(83)90021-1

zbMATH Keywords

computational complexitytrade-offcircuit size complexity

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Related Items (2)

Extreme time-space tradeoffs for graphs with small space requirements ⋮ Size-space tradeoffs for oblivious computations

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Size-space tradeoffs for oblivious computations
• Time-space tradeoffs for computing functions, using connectivity properties of their circuits
• Graph-theoretic properties in computational complexity
• On programming of arithmetic operations
• Shifting Graphs and Their Applications
• Superconcentrators
• Space-time trade-offs on the FFT algorithm
• On compiling algorithms for arithmetic expressions
• On arithmetic expressions and trees

This page was built for publication: Size-space tradeoffs for oblivious computations