Time and Space Complexity of Reversible Pebbling
SOFSEM '01 Proceedings of the 28th Conference on Current Trends in Theory and Practice of Informatics Piestany: Theory and Practice of Informatics
Reversible Space Equals Deterministic Space
CCC '97 Proceedings of the 12th Annual IEEE Conference on Computational Complexity
Quantum circuit oracles for Abstract Machine computations
Theoretical Computer Science
| Hi-index | 0.01 |
Reversible simulation of irreversible algorithms is analyzed in the stylized form of a `reversible' pebble game. While such simulations incur little overhead in additional computation time, they use a large amount of additional memory space during the computation. We show that among all simulations which can be modeled by the pebble game, Bennett's simulation is optimal in that it uses the least auxiliary space for the greatest number of simulated steps. We give a trade-off of storage space versus irreversible erasure. Examples of reversible algorithms are algorithms for quantum computers.