Time/space trade-offs for reversible computation
SIAM Journal on Computing
A note on Bennett's time space tradeoff for reversible computation
SIAM Journal on Computing
The Simplifier of the Program Verifier "Tatzelwurm"
Proceedings of the Österreichische Artificial Intelligence
Time and Space Bounds for Reversible Simulation
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
Reversible Simulation of Irreversible Computation
CCC '96 Proceedings of the 11th Annual IEEE Conference on Computational Complexity
Record of the Project MAC conference on concurrent systems and parallel computation
Spatial complexity of reversibly computable DAG
CASES '09 Proceedings of the 2009 international conference on Compilers, architecture, and synthesis for embedded systems
| Hi-index | 0.00 |
In the context of quantum computing, reversible computations play an important role. In this paper the model of the reversible pebble game introduced by Bennett is considered. Reversible pebble game is an abstraction of a reversible computation, that allows to examine the space and time complexity for various classes of problems. We present techniques for provinglo wer and upper bounds on time and space complexity. Usingthese techniques we show a partial lower bound on time for optimal space (time for optimal space is not o(n lg n)) and a time-space tradeoff (space O(k驴n) for time 2kn) for a chain of length n. Further, we show a tight optimal space bound (h+驴(lg* h)) for a binary tree of height h and we discuss space complexity for a butterfly. By these results we give an evidence, that for reversible computations more resources are needed with respect to standard irreversible computations.