Corrigendum to ``Time-space tradeoffs for computing functions, using connectivity properties of their circuits

DOI10.1016/0022-0000(81)90007-6zbMath0465.68020OpenAlexW4211197056MaRDI QIDQ1154806

Martin Tompa

Publication date: 1981

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(81)90007-6

zbMATH Keywords

convolutiondiscrete Fourier transformpolynomial multiplicationpebble gamegratesuper concentrator

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Related Items (4)

Static-memory-hard functions, and modeling the cost of space vs. time ⋮ Extending the Hong-Kung model to memory hierarchies ⋮ The parallel reversible pebbling game: analyzing the post-quantum security of iMHFs ⋮ Superconcentrators of depth 2

This page was built for publication: Corrigendum to ``Time-space tradeoffs for computing functions, using connectivity properties of their circuits