Pages that link to "Item:Q340566"

The following pages link to On asymptotic gate complexity and depth of reversible circuits without additional memory (Q340566):

Displaying 10 items.

• Estimation of the depth of reversible circuits consisting of NOT, CNOT and 2-CNOT gates (Q334289) (← links)
• Realization and synthesis of reversible functions (Q633699) (← links)
• On the gate complexity of reversible circuits consisting of NOT, CNOT and 2-CNOT gates (Q1675526) (← links)
• Reversible circuit synthesis by genetic programming using dynamic gate libraries (Q1679386) (← links)
• Finding the redundant gates in reversible circuits (Q1796385) (← 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)
• Complexity of reversible circuits and their quantum implementations (Q2634672) (← links)
• Application of Permutation Group Theory in Reversible Logic Synthesis (Q3186603) (← links)
• On the complexity of gradient gate circuits (Q4857749) (← links)