scientific article

zbMath0715.94020MaRDI QIDQ3202957

N. A. Karpova

Publication date: 1989

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

truth functionsmeasures of complexitycomputations with restricted memory

Mathematics Subject Classification ID

Boolean functions (06E30)

Related Items (6)

Estimation of the depth of reversible circuits consisting of NOT, CNOT and 2-CNOT gates ⋮ On the gate complexity of reversible circuits consisting of NOT, CNOT and 2-CNOT gates ⋮ 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 ⋮ 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

This page was built for publication: