Time/Space Trade-Offs for Reversible Computation
From MaRDI portal
Publication:3832041
Recommendations
Cited in
(only showing first 100 items - show all)- Computability and complexity of ray tracing
- Common knowledge and update in finite environments
- Reductions and functors from problems to word problems
- Reversible space equals deterministic space
- Quantum search on structured problems
- \texttt{PSPACE}-complete problems for subgroups of free groups and inverse finite automata
- Quantum computing and quadratically signed weight enumerators
- Quantum neural networks
- Static-memory-hard functions, and modeling the cost of space vs. time
- Quantum one-way permutation over the finite field of two elements
- Estimating the cost of generic quantum pre-image attacks on SHA-2 and SHA-3
- Low-communication parallel quantum multi-target preimage search
- The complexity of reversible cellular automata
- Space-bounded quantum complexity
- A class of recursive permutations which is primitive recursive complete
- A trade-off between classical and quantum circuit size for an attack against CSIDH
- Reversible pebble games and the relation between tree-like and general resolution space
- Nullstellensatz size-degree trade-offs from reversible pebbling
- Internal symmetries and linear properties: full-permutation distinguishers and improved collisions on \textsf{Gimli}
- Continuous verifiable delay functions
- Quantum security analysis of CSIDH
- Simpler constructions of asymmetric primitives from obfuscation
- Beyond quadratic speedups in quantum attacks on symmetric schemes
- Adaptively secure garbling schemes for parallel computations
- Reversibility of computations in graph-walking automata
- The word problem of the Brin-Thompson group is \textsf{coNP}-complete
- Efficient and exact quantum compression
- Pebbling meets coloring: reversible pebble game on trees
- Logical depth for reversible Turing machines with an application to the rate of decrease in logical depth for general Turing machines
- When-and how-can a cellular automaton be rewritten as a lattice gas?
- A common algebraic description for probabilistic and quantum computations
- New results on \(\mathsf{Gimli}\): full-permutation distinguishers and improved collisions
- Reversible computing from a programming language perspective
- On treewidth, separators and Yao's garbling
- The cost of adaptivity in security games on graphs
- Time and space bounds for reversible simulation
- A hierarchy of fast reversible Turing machines
- Real-time methods in reversible computation
- Ricercar: a language for describing and rewriting reversible circuits with ancillae and its permutation semantics
- Time complexity of tape reduction for reversible Turing machines
- Reversibility in space-bounded computation
- Quantitative Analysis of Concurrent Reversible Computations
- Reversible and irreversible computations of deterministic finite-state devices
- Balloon hashing: a memory-hard function providing provable protection against sequential attacks
- Efficient Turing-universal computation with DNA polymers
- Reversibility and adiabatic computation: trading time and space for energy
- Toward an energy efficient language and compiler for (partially) reversible algorithms
- Reversible pebble game on trees
- Programming techniques for reversible comparison sorts
- A Note on Bennett’s Time-Space Tradeoff for Reversible Computation
- Reversible Turing Machines and Polynomial Time Reversibly Computable Functions
- Periodicity and Immortality in Reversible Computing
- ON THE WORD PROBLEM FOR TENSOR PRODUCTS AND AMALGAMS OF MONOIDS
- scientific article; zbMATH DE number 1754652 (Why is no real title available?)
- Reversal-space trade-offs for simultaneous resource-bounded nondeterministic Turing machines
- PSPACE-completeness of certain algorithmic problems on the subgroups of free groups
- Improved reversible and quantum circuits for Karatsuba-based integer multiplication
- Time and space complexity of reversible pebbling
- scientific article; zbMATH DE number 781240 (Why is no real title available?)
- Boolean satisfiability in quantum compilation
- Improved quantum circuits for elliptic curve discrete logarithms
- An unambiguous class possessing a complete set
- LESS is more: code-based signatures without syndromes
- The stochastic thermodynamics of computation
- Algorithmic arguments in physics of computation
- Quantum Chebyshev's Inequality and Applications
- Nullstellensatz size-degree trade-offs from reversible pebbling
- Clean reversible simulations of ranking binary trees
- Hardness of continuous local search: query complexity and cryptographic lower bounds
- Breaking the sub-exponential barrier in obfustopia
- Every polynomial-time 1-degree collapses if and only if P = PSPACE
- CIRCUITS, THE GROUPS OF RICHARD THOMPSON, AND coNP-COMPLETENESS
- Rush Hour is PSPACE-complete, or ``Why you should generously tip parking lot attendants
- Energy efficient sorting, selection and searching
- Quantum time/memory/data tradeoff attacks
- Optimizing quantum space using spooky pebble games
- The parallel reversible pebbling game: analyzing the post-quantum security of iMHFs
- Quantum circuits for high-degree and half-multiplication for post-quantum analysis
- Energy efficient sorting, selection and searching
- An introduction to quantum computing for statisticians and data scientists
- Towards clean reversible lossless compression. A reversible programming experiment with zip
- Improving generic attacks using exceptional functions
- Inverse monoids associated with the complexity class NP
- Reversible simulation of space-bounded computations
- Space-efficient and noise-robust quantum factoring
- Trade-offs between classical and quantum space using spooky pebbling
- Quantum non-identical mean estimation: efficient algorithms and fundamental limits
- Explicit time and space efficient encoders exist only with random access
- The impact of reversibility on parallel pebbling
- The space-time cost of purifying quantum computations
- Understanding the thermodynamics of computation: a pedagogical overview
- Towards general-purpose program obfuscation via local mixing
- Reducing the number of qubits in quantum information set decoding
- Improved classical and quantum algorithms for the shortest vector problem via bounded distance decoding
- Notes on Landauer's principle, reversible computation, and Maxwell's demon
- Pebble games and algebraic proof systems
- Pebble games and algebraic proof systems
- An implementation of quantum oracles for the finite element method
- Parallel spooky pebbling makes Regev factoring more practical
- Quantum search with in-place queries
This page was built for publication: Time/Space Trade-Offs for Reversible Computation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3832041)
