Reversible simulation of space-bounded computations
From MaRDI portal
Publication:673645
DOI10.1016/0304-3975(95)80017-4zbMATH Open0873.68061OpenAlexW2018044965MaRDI QIDQ673645FDOQ673645
Authors: Pilu Crescenzi, Christos Papadimitriou 
Publication date: 28 February 1997
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-3975(95)80017-4
Recommendations
- Time and space bounds for reversible simulation
- scientific article; zbMATH DE number 1754652
- Reversibility in space-bounded computation
- Time/Space Trade-Offs for Reversible Computation
- A Note on Bennett’s Time-Space Tradeoff for Reversible Computation
- Verified compilation of space-efficient reversible circuits
- Reversible parallel computation: An evolving space-model
- A structural approach to reversible computation
- Quantitative Analysis of Concurrent Reversible Computations
- Applying reversibility theory for the performance evaluation of reversible computations
Cites Work
- Relationships between nondeterministic and deterministic tape complexities
- Irreversibility and Heat Generation in the Computing Process
- Logical Reversibility of Computation
- On the complexity of the parity argument and other inefficient proofs of existence
- Quantum complexity theory
- On Relating Time and Space to Size and Depth
- Symmetric space-bounded computation
- Time/Space Trade-Offs for Reversible Computation
- A Note on Bennett’s Time-Space Tradeoff for Reversible Computation
Cited In (13)
- Reversibility of computations in graph-walking automata
- Title not available (Why is that?)
- Reversible Turing Machines and Polynomial Time Reversibly Computable Functions
- Reversible parallel computation: An evolving space-model
- Rush Hour is PSPACE-complete, or ``Why you should generously tip parking lot attendants
- Verified compilation of space-efficient reversible circuits
- Time and space bounds for reversible simulation
- Quantitative Analysis of Concurrent Reversible Computations
- Space-bounded quantum complexity
- Reversible computation in term rewriting
- Reversible space equals deterministic space
- Reversibility in space-bounded computation
- An improved simulation of space and reversal bounded deterministic Turing machines by width and depth bounded uniform circuits
This page was built for publication: Reversible simulation of space-bounded computations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q673645)
