scientific article; zbMATH DE number 4179292
From MaRDI portal
Publication:3202957
Recommendations
- A limited memory method for large scale problems
- Limited memory space dilation and reduction algorithms
- Classical and Quantum Computations with Restricted Memory
- Memory-tight reductions
- Memoryless computation: new results, constructions, and extensions
- Memory lower bounds of reductions revisited
- Memory-efficient fixpoint computation
- scientific article; zbMATH DE number 5875145
- Efficiently computing data-independent memory-hard functions
Cited in
(16)- On the gate complexity of reversible circuits consisting of NOT, CNOT and 2-CNOT gates
- Memory-tight reductions
- On the dependence of the complexity and depth of reversible circuits consisting of NOT, CNOT, and 2-CNOT gates on the number of additional inputs
- On synthesis of reversible circuits consisting of NOT, CNOT, 2-CNOT gates with small number of additional inputs
- Polynomial upper bounds on the size of changes of a RAM+BOOL program as a tool for proving belonging to FP
- Approachability with bounded memory
- On implementation of Boolean functions by contact circuits of minimal uniform width
- Retracted: Synthesis of reversible circuits consisting of NOT, CNOT and 2-CNOT gates with small number of additional inputs
- Computation with Narrow CTCs
- Delegating RAM Computations
- Mapping Computation with No Memory
- Estimation of the depth of reversible circuits consisting of NOT, CNOT and 2-CNOT gates
- scientific article; zbMATH DE number 4170913 (Why is no real title available?)
- Constructing sets of functions which have a givenF-cardinality
- Three generators for minimal writing-space computations
- scientific article; zbMATH DE number 7119801 (Why is no real title available?)
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3202957)
