Klaus-Jrn Lange, Pierre McKenzie, and Alain Tapp. Reversible space equals deterministic space. In Proc. 12th Annual IEEE Conf. on Computational Complexity (CCC '97), pages 4550, June 1997. http://www.iro.umontreal.ca/~tappa/Publications/LMT'97_abstract.- html. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Relativized Separation of Reversible and Irreversible.. - Frank, Ammer (Correct)
....of reversible computing might be much greater, and be realized much sooner, than would otherwise be the case. Old and new complexity conjectures. Li and Vitnyi conjectured in 1996 [14] that Bennett s algorithm was optimal, in terms of space complexity. Lange et al. disproved this conjecture in [15], but with a construction that incurred exponential increases in time complexity. However, we hypothesize that Bennett s algorithm remains optimal under the metric of space time complexity, or space complexity multiplied by time complexity for a given algorithm, which is, anyway, the complexity ....
....technique to provide space e cient reversible simulation of nondeterministic Turing machines as well. 3.4.1. Achieving linear space complexity Bennett s results stood for almost a decade as the most space e cient reversible simulation technique known, but in 1997, Lange, McKenzie, and Tapp [15] showed how to simulate Turing machines reversibly in linear space but using worst case exponential time. Their technique is very clever, but simple in concept: Given a con guration of an irreversible machine, they show that one can reversibly enumerate its possible predecessors. Given this, ....
[Article contains additional citation context not shown here]
Klaus-Jrn Lange, Pierre McKenzie, and Alain Tapp. Reversible space equals deterministic space. In Proc. 12th Annual IEEE Conf. on Computational Complexity (CCC '97), pages 4550, June 1997. http://www.iro.umontreal.ca/~tappa/Publications/LMT'97_abstract.- html.
Relativized Separation of Reversible and Irreversible.. - Frank, Ammer (2001) (Correct)
....technique to provide space e cient reversible simulation of nondeterministic Turing machines as well. 3.4. 1 Achieving linear space complexity Bennett s results stood for almost a decade as the most space e cient reversible simulation technique known, but in 1997, Lange, McKenzie, and Tapp [13] showed how to simulate Turing machines reversibly in linear space but using worst case exponential time. Their technique is very clever, but simple in 16 0 9 Segments completed 0 10 20 30 40 50 0 8 Segments completed 0 10 20 30 40 50 Simulation time (a) b) Figure 3: ....
....of an irreversible machine s computation tree. Although the tree has branches, the Euler tour is itself both forward and reverse deterministic, and so can be traversed in purely reversible fashion, using no more space than is needed to keep track of the current irreversible machine con guration [13]. concept: Given a con guration of an irreversible machine, they show that one can reversibly enumerate its possible predecessors. Given this, starting with the initial state of the irreversible machine, the reversible machine can traverse the edge of the irreversible machine s tree of possible ....
[Article contains additional citation context not shown here]
Klaus-Jrn Lange, Pierre McKenzie, and Alain Tapp. Reversible space equals deterministic space. In Proc. 12th Annual IEEE Conf. on Computational Complexity (CCC '97), pages 4550, June 1997. http://www.iro.- umontreal.ca/~tappa/Publications/LMT'97_abstract.html.
Rush Hour is PSPACE-complete, or "Why you should.. - Gary Flake, Eric Baum (Correct)
....time O(T 1 ) and space O(S log T ) or with time and space both at O(ST ) Thus the emulation can be done in time and space that is polynomial in the original requirements. It is even possible to do the emulation in O(S) space, but at the expense of having an exponential slowdown of time [15]. With the known bounds on emulating a standard TM with reversible logic, we can conclude that there exists a GRH con guration that emulates a TM that uses time T and space S such that the time and space requirements of the emulation are both polynomial in T and S, respectively. This means that ....
Klaus-Jorn Lange, Pierre McKenzie, and Alain Tapp. Reversible space equals deterministic space. In Proceedings of the 12th Annual IEEE Conference on Computational Complexity (CCC '97), pages 45{ 50, June 1997.
A Compendium of Problems Complete for Symmetric Logarithmic.. - Alvarez, Greenlaw (1996) (7 citations) (Correct)
No context found.
Klaus-J orn Lange, Pierre McKenzie, and Alain Tapp, Reversible space equals deterministic space. In Proceedings of the 12th Conference on Computational Complexity, Ulm, Germany, 1997, IEEE, 45--50.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC