Pages that link to "Item:Q3832041"
From MaRDI portal
The following pages link to Time/Space Trade-Offs for Reversible Computation (Q3832041):
Displaying 50 items.
- Inverse monoids associated with the complexity class NP (Q666698) (← links)
- Reversible simulation of space-bounded computations (Q673645) (← links)
- Notes on Landauer's principle, reversible computation, and Maxwell's demon (Q720557) (← links)
- Low-gate quantum golden collision finding (Q832353) (← links)
- Fundamentals of reversible flowchart languages (Q896906) (← links)
- Reversible computing and cellular automata -- a survey (Q924686) (← links)
- One-way permutations, computational asymmetry and distortion. (Q959774) (← links)
- Quantum circuit oracles for abstract machine computations (Q960862) (← links)
- Computability and complexity of ray tracing (Q1327451) (← links)
- Common knowledge and update in finite environments (Q1383157) (← links)
- Reductions and functors from problems to word problems (Q1566706) (← links)
- Reversible space equals deterministic space (Q1567403) (← links)
- Quantum search on structured problems (Q1573936) (← links)
- \texttt{PSPACE}-complete problems for subgroups of free groups and inverse finite automata (Q1575552) (← links)
- Quantum computing and quadratically signed weight enumerators (Q1603471) (← links)
- Quantum neural networks (Q1604195) (← links)
- Static-memory-hard functions, and modeling the cost of space vs. time (Q1629397) (← links)
- Quantum one-way permutation over the finite field of two elements (Q1679363) (← links)
- Estimating the cost of generic quantum pre-image attacks on SHA-2 and SHA-3 (Q1698647) (← links)
- Low-communication parallel quantum multi-target preimage search (Q1746977) (← links)
- The complexity of reversible cellular automata (Q1884853) (← links)
- Space-bounded quantum complexity (Q1961378) (← links)
- A class of recursive permutations which is primitive recursive complete (Q1989331) (← links)
- A trade-off between classical and quantum circuit size for an attack against CSIDH (Q2027261) (← links)
- Reversible pebble games and the relation between tree-like and general resolution space (Q2033469) (← links)
- Nullstellensatz size-degree trade-offs from reversible pebbling (Q2040600) (← links)
- Internal symmetries and linear properties: full-permutation distinguishers and improved collisions on \textsf{Gimli} (Q2051403) (← links)
- Continuous verifiable delay functions (Q2055650) (← links)
- Quantum security analysis of CSIDH (Q2119022) (← links)
- Simpler constructions of asymmetric primitives from obfuscation (Q2152062) (← links)
- Beyond quadratic speedups in quantum attacks on symmetric schemes (Q2170092) (← links)
- Adaptively secure garbling schemes for parallel computations (Q2175942) (← links)
- Reversibility of computations in graph-walking automata (Q2216129) (← links)
- The word problem of the Brin-Thompson group is \textsf{coNP}-complete (Q2306657) (← links)
- Efficient and exact quantum compression (Q2373873) (← links)
- Pebbling meets coloring: reversible pebble game on trees (Q2409574) (← links)
- When-and how-can a cellular automaton be rewritten as a lattice gas? (Q2518377) (← links)
- A common algebraic description for probabilistic and quantum computations (Q2575744) (← links)
- New results on \(\mathsf{Gimli}\): full-permutation distinguishers and improved collisions (Q2692336) (← links)
- Reversible computing from a programming language perspective (Q2693633) (← links)
- On treewidth, separators and Yao's garbling (Q2697873) (← links)
- The cost of adaptivity in security games on graphs (Q2697875) (← links)
- A Hierarchy of Fast Reversible Turing Machines (Q2822488) (← links)
- Real-Time Methods in Reversible Computation (Q2822490) (← links)
- Ricercar: A Language for Describing and Rewriting Reversible Circuits with Ancillae and Its Permutation Semantics (Q2822512) (← links)
- Reversibility in space-bounded computation (Q2930716) (← links)
- Reversible and Irreversible Computations of Deterministic Finite-State Devices (Q2946323) (← links)
- Balloon Hashing: A Memory-Hard Function Providing Provable Protection Against Sequential Attacks (Q2958121) (← links)
- Efficient Turing-Universal Computation with DNA Polymers (Q3070966) (← links)
- Toward an Energy Efficient Language and Compiler for (Partially) Reversible Algorithms (Q3186588) (← links)
