Pages that link to "Item:Q3832041"
From MaRDI portal
The following pages link to Time/Space Trade-Offs for Reversible Computation (Q3832041):
Displaying 31 items.
- Efficient Turing-Universal Computation with DNA Polymers (Q3070966) (← links)
- Reversibility and adiabatic computation: trading time and space for energy (Q3126112) (← links)
- Toward an Energy Efficient Language and Compiler for (Partially) Reversible Algorithms (Q3186588) (← links)
- Reversible Pebble Game on Trees (Q3196374) (← links)
- Periodicity and Immortality in Reversible Computing (Q3599146) (← links)
- ON THE WORD PROBLEM FOR TENSOR PRODUCTS AND AMALGAMS OF MONOIDS (Q4513298) (← links)
- PSPACE-completeness of certain algorithmic problems on the subgroups of free groups (Q4632433) (← links)
- Improved reversible and quantum circuits for Karatsuba-based integer multiplication. (Q4637981) (← links)
- Time and space complexity of reversible pebbling (Q4825392) (← links)
- Boolean satisfiability in quantum compilation (Q4993497) (← links)
- Improved Quantum Circuits for Elliptic Curve Discrete Logarithms (Q5041233) (← links)
- An unambiguous class possessing a complete set (Q5048936) (← links)
- LESS is More: Code-Based Signatures Without Syndromes (Q5048961) (← links)
- The stochastic thermodynamics of computation (Q5053500) (← links)
- Algorithmic arguments in physics of computation (Q5057445) (← links)
- Quantum Chebyshev's Inequality and Applications (Q5091227) (← links)
- Nullstellensatz size-degree trade-offs from reversible pebbling (Q5091769) (← links)
- Clean Reversible Simulations of Ranking Binary Trees (Q5112174) (← links)
- Hardness of Continuous Local Search: Query Complexity and Cryptographic Lower Bounds (Q5138782) (← links)
- Breaking the Sub-Exponential Barrier in Obfustopia (Q5270361) (← links)
- Every polynomial-time 1-degree collapses if and only if P = PSPACE (Q5311749) (← links)
- CIRCUITS, THE GROUPS OF RICHARD THOMPSON, AND coNP-COMPLETENESS (Q5470158) (← links)
- Rush Hour is PSPACE-complete, or ``Why you should generously tip parking lot attendants'' (Q5958338) (← links)
- Energy efficient sorting, selection and searching (Q6091161) (← links)
- Quantum time/memory/data tradeoff attacks (Q6146595) (← links)
- The parallel reversible pebbling game: analyzing the post-quantum security of iMHFs (Q6169348) (← links)
- Quantum circuits for high-degree and half-multiplication for post-quantum analysis (Q6547862) (← links)
- Energy efficient sorting, selection and searching (Q6548954) (← links)
- An introduction to quantum computing for statisticians and data scientists (Q6620130) (← links)
- Towards clean reversible lossless compression. A reversible programming experiment with zip (Q6637591) (← links)
- Improving generic attacks using exceptional functions (Q6652911) (← links)