A Note on Bennett’s Time-Space Tradeoff for Reversible Computation
From MaRDI portal
Publication:3474887
Recommendations
Cited in
(23)- Time and space complexity of reversible pebbling
- Quantum circuit oracles for abstract machine computations
- scientific article; zbMATH DE number 1754652 (Why is no real title available?)
- 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
- scientific article; zbMATH DE number 2080928 (Why is no real title available?)
- 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
- Nullstellensatz size-degree trade-offs from reversible pebbling
- Time and space bounds for reversible simulation
- \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
- Reversible space equals deterministic space
- Time-Complexity of the Word Problem for Semigroups and the Higman Embedding Theorem
- Reversibility in space-bounded computation
- Reversible simulation of space-bounded computations
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)
