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

DOI10.1515/dma-2021-0006zbMath1499.68107OpenAlexW3131212696MaRDI QIDQ1996847

Dmitriy V. Zakablukov

Publication date: 26 February 2021

Published in: Discrete Mathematics and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1515/dma-2021-0006

zbMATH Keywords

circuit complexityreversible circuitscircuit depthcomputations with memory

Mathematics Subject Classification ID

Networks and circuits as models of computation; circuit complexity (68Q06)

Related Items (2)

Retracted: Synthesis of reversible circuits consisting of NOT, CNOT and 2-CNOT gates with small number of additional inputs ⋮ On synthesis of reversible circuits consisting of NOT, CNOT, 2-CNOT gates with small number of additional inputs

Cites Work

• 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
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: 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