A Note on Bennett’s Time-Space Tradeoff for Reversible Computation
From MaRDI portal
Publication:3474887
DOI10.1137/0219046zbMATH Open0697.68043OpenAlexW2022763264MaRDI QIDQ3474887FDOQ3474887
Authors: Robert Levine, Alan T. Sherman 
Publication date: 1990
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/3c89dd1992b34aafd7122a400616c4f2a09cb85f
Recommendations
Analysis of algorithms and problem complexity (68Q25) Complexity of computation (including implicit computational complexity) (03D15)
Cited In (23)
- Title not available (Why is that?)
- Quantum circuit oracles for abstract machine computations
- Low-gate quantum golden collision finding
- Notes on Landauer's principle, reversible computation, and Maxwell's demon
- Rush Hour is PSPACE-complete, or ``Why you should generously tip parking lot attendants
- Quantum security analysis of CSIDH
- Title not available (Why is that?)
- PSPACE-completeness of certain algorithmic problems on the subgroups of free groups
- Beyond quadratic speedups in quantum attacks on symmetric schemes
- On treewidth, separators and Yao's garbling
- Time and space bounds for reversible simulation
- Nullstellensatz size-degree trade-offs from reversible pebbling
- \texttt{PSPACE}-complete problems for subgroups of free groups and inverse finite automata
- Time/Space Trade-Offs for Reversible Computation
- Internal symmetries and linear properties: full-permutation distinguishers and improved collisions on \textsf{Gimli}
- Real-time methods in reversible computation
- Optimizing reversible simulation of injective functions
- New results on \(\mathsf{Gimli}\): full-permutation distinguishers and improved collisions
- Time-Complexity of the Word Problem for Semigroups and the Higman Embedding Theorem
- Reversible space equals deterministic space
- Reversibility in space-bounded computation
- Reversible simulation of space-bounded computations
- Time and space complexity of reversible pebbling
This page was built for publication: A Note on Bennett’s Time-Space Tradeoff for Reversible Computation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3474887)
