Time and space complexity of reversible pebbling

DOI10.1051/ita:2004008zbMath1082.68031OpenAlexW1976150152MaRDI QIDQ4825392

Richard Královič

Publication date: 28 October 2004

Published in: RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)

Full work available at URL: http://www.numdam.org/item?id=ITA_2004__38_2_137_0

zbMATH Keywords

quantum computing

Mathematics Subject Classification ID

Related Items (4)

Reversible computing from a programming language perspective ⋮ Reversible pebble games and the relation between tree-like and general resolution space ⋮ Nullstellensatz size-degree trade-offs from reversible pebbling ⋮ Nullstellensatz size-degree trade-offs from reversible pebbling

Cites Work

• Unnamed Item
• Unnamed Item
• Reversibility and adiabatic computation: trading time and space for energy
• A Note on Bennett’s Time-Space Tradeoff for Reversible Computation
• Time/Space Trade-Offs for Reversible Computation
• Pebbling dynamic graphs in minimal space

This page was built for publication: Time and space complexity of reversible pebbling