The following pages link to (Q3202957):
Displaying 16 items.
- Estimation of the depth of reversible circuits consisting of NOT, CNOT and 2-CNOT gates (Q334289) (← links)
- On the gate complexity of reversible circuits consisting of NOT, CNOT and 2-CNOT gates (Q1675526) (← links)
- Memory-tight reductions (Q1675721) (← links)
- 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 (Q1996847) (← links)
- On synthesis of reversible circuits consisting of NOT, CNOT, 2-CNOT gates with small number of additional inputs (Q2081007) (← links)
- Polynomial upper bounds on the size of changes of a RAM+BOOL program as a tool for proving belonging to FP (Q2253865) (← links)
- Approachability with bounded memory (Q2389319) (← links)
- On implementation of Boolean functions by contact circuits of minimal uniform width (Q2685505) (← links)
- Retracted: Synthesis of reversible circuits consisting of NOT, CNOT and 2-CNOT gates with small number of additional inputs (Q2685510) (← links)
- Computation with Narrow CTCs (Q3007717) (← links)
- Delegating RAM Computations (Q3181023) (← links)
- Mapping Computation with No Memory (Q3184759) (← links)
- (Q3496340) (← links)
- Constructing sets of functions which have a givenF-cardinality (Q3992018) (← links)
- Three generators for minimal writing-space computations (Q4508636) (← links)
- (Q5237775) (← links)
