The complexity of iterated reversible computation

Cites Work

Conservative logic
Endomorphisms and automorphisms of the shift dynamical system
Interval exchange transformations
Quantum computational networks
Irreversibility and Heat Generation in the Computing Process
Title not available (Why is that?)
Logical Reversibility of Computation
Reversible computing and cellular automata -- a survey
On the complexity of the parity argument and other inefficient proofs of existence
Hamiltonian Cycles and Uniquely Edge Colourable Graphs
Hard tiling problems with simple tiles
On Embedding a Graph in the Grid with the Minimum Number of Bends
Title not available (Why is that?)
Tesselations with local transformations
Reversible Turing Machines and Polynomial Time Reversibly Computable Functions
Complexity of some geometric and topological problems
Period of a Discrete Cat Mapping
The mathematics of perfect shuffles
The complexity of finding a second Hamiltonian cycle in cubic graphs
Efficient exhaustive listings of reversible one dimensional cellular automata
On Hamiltonian Circuits
Title not available (Why is that?)
Computation and construction universality of reversible cellular automata
A computation-universal two-dimensional 8-state triangular reversible cellular automaton
Simple universal one-dimensional reversible cellular automata
Firing squad synchronization problem in reversible cellular automata
Title not available (Why is that?)
Reversible simulation of one-dimensional irreversible cellular automata
The complexity of graph connectivity
Polynomial Space Counting Problems
The General Chinese Remainder Theorem
Intrinsic universality of a 1-dimensional reversible Cellular Automaton
Measure-Preserving Transformations and Random Processes
Reversible space equals deterministic space
Tracing compressed curves in triangulated surfaces
THE COMPLEXITY OF THOMASON’S ALGORITHM FOR FINDING A SECOND HAMILTONIAN CYCLE
Thomason's algorithm for finding a second Hamiltonian circuit through a given edge in a cubic graph is exponential on Krawczyk's graphs
A short note on graphs with long Thomason chains
Trace complexity of chaotic reversible cellular automata
Title not available (Why is that?)
A Footnote to the Three Gaps Theorem

This page was built for publication: The complexity of iterated reversible computation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6566596)