Pages that link to "Item:Q1567403"

The following pages link to Reversible space equals deterministic space (Q1567403):

Displaying 40 items.

• Quantum branching programs and space-bounded nonuniform quantum complexity (Q1779302) (← links)
• Quantum versus deterministic counter automata (Q1779306) (← links)
• Nullstellensatz size-degree trade-offs from reversible pebbling (Q2040600) (← links)
• Lamplighter groups and automata (Q2170284) (← links)
• Reversibility of computations in graph-walking automata (Q2216129) (← links)
• The bouncing ball and the Grünwald-Letnikov definition of fractional derivative (Q2236845) (← links)
• Logical depth for reversible Turing machines with an application to the rate of decrease in logical depth for general Turing machines (Q2420575) (← links)
• State complexity of transforming graph-walking automata to halting, returning and reversible (Q2687992) (← links)
• Reversible computing from a programming language perspective (Q2693633) (← links)
• Time and space bounds for reversible simulation (Q2766195) (← links)
• A Hierarchy of Fast Reversible Turing Machines (Q2822488) (← links)
• Real-Time Methods in Reversible Computation (Q2822490) (← links)
• Minimal and Reduced Reversible Automata (Q2829980) (← links)
• Reversibility in space-bounded computation (Q2930716) (← links)
• Aspects of Reversibility for Classical Automata (Q2944881) (← links)
• Reversible Limited Automata (Q2945882) (← links)
• Reversible and Irreversible Computations of Deterministic Finite-State Devices (Q2946323) (← links)
• When input-driven pushdown automata meet reversiblity (Q2969982) (← links)
• Toward an Energy Efficient Language and Compiler for (Partially) Reversible Algorithms (Q3186588) (← links)
• A Deterministic Two-Way Multi-head Finite Automaton Can Be Converted into a Reversible One with the Same Number of Heads (Q3453732) (← links)
• (Q4580325) (← links)
• Improved reversible and quantum circuits for Karatsuba-based integer multiplication. (Q4637981) (← links)
• (Q5016363) (← links)
• (Q5016365) (← links)
• Nullstellensatz size-degree trade-offs from reversible pebbling (Q5091769) (← links)
• Queue Automata: Foundations and Developments (Q5112182) (← links)
• Concise Representations of Reversible Automata (Q5205047) (← links)
• A hybrid algorithm framework for small quantum computers with application to finding Hamiltonian cycles (Q5218804) (← links)
• On the power of two-way multihead quantum finite automata (Q5223828) (← links)
• Real-Time Reversible One-Way Cellular Automata (Q5501613) (← links)
• Language Recognition by Reversible Partitioned Cellular Automata (Q5501617) (← links)
• (Q5867516) (← links)
• Transducing reversibly with finite state machines (Q5919580) (← links)
• Transducing reversibly with finite state machines (Q5920055) (← links)
• Rush Hour is PSPACE-complete, or ``Why you should generously tip parking lot attendants'' (Q5958338) (← links)
• Descriptive Complexity of Reversible Languages Having Finitely Many Reduced Automata (Q6114868) (← links)
• Weakly and Strongly Irreversible Regular Languages (Q6114869) (← links)
• Energy complexity of regular languages (Q6199407) (← links)
• The complexity of iterated reversible computation (Q6566596) (← links)
• Towards clean reversible lossless compression. A reversible programming experiment with zip (Q6637591) (← links)