Pages that link to "Item:Q3474887"
From MaRDI portal
The following pages link to A Note on Bennett’s Time-Space Tradeoff for Reversible Computation (Q3474887):
Displayed 8 items.
- Reversible simulation of space-bounded computations (Q673645) (← links)
- Notes on Landauer's principle, reversible computation, and Maxwell's demon (Q720557) (← links)
- Quantum circuit oracles for abstract machine computations (Q960862) (← links)
- Reversible space equals deterministic space (Q1567403) (← links)
- \texttt{PSPACE}-complete problems for subgroups of free groups and inverse finite automata (Q1575552) (← links)
- Time-Complexity of the Word Problem for Semigroups and the Higman Embedding Theorem (Q4354236) (← links)
- Time and space complexity of reversible pebbling (Q4825392) (← links)
- Rush Hour is PSPACE-complete, or ``Why you should generously tip parking lot attendants'' (Q5958338) (← links)