On synthesis of reversible circuits consisting of NOT, CNOT, 2-CNOT gates with small number of additional inputs

DOI10.1515/DMA-2022-0023OpenAlexW4295138717MaRDI QIDQ2081007FDOQ2081007

Dmitriy V. Zakablukov

Publication date: 12 October 2022

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

Full work available at URL: https://doi.org/10.1515/dma-2022-0023

zbMATH Keywords

circuit complexityreversible circuitscomputations with memory

Mathematics Subject Classification ID

Switching theory, applications of Boolean algebras to circuits and networks (94C11) Networks and circuits as models of computation; circuit complexity (68Q06)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• On the gate complexity of reversible circuits consisting of NOT, CNOT and 2-CNOT gates
• 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

Cited In (1)

• 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

This page was built for publication: On synthesis of reversible circuits consisting of NOT, CNOT, 2-CNOT gates with small number of additional inputs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2081007)