Pages that link to "Item:Q734115"
From MaRDI portal
The following pages link to Synthesis of reversible circuits with minimal costs (Q734115):
Displaying 16 items.
- A reversible logical circuit synthesis algorithm based on decomposition of cycle representations of permutations (Q1616470) (← links)
- Improving the quantum cost of reversible Boolean functions using reorder algorithm (Q1654122) (← links)
- Reversible circuit synthesis by genetic programming using dynamic gate libraries (Q1679386) (← links)
- Controlled and uncontrolled SWAP gates in reversible logic synthesis (Q1705595) (← links)
- New design of reversible full adder/subtractor using \(R\) gate (Q1740954) (← links)
- Verified compilation of space-efficient reversible circuits (Q2164204) (← links)
- An improved design of \(n\)-bit universal reversible gate library (Q2322160) (← links)
- Improving the quantum cost of NCT-based reversible circuit (Q2347661) (← links)
- Efficient algorithms for optimal 4-bit reversible logic system synthesis (Q2375481) (← links)
- Upper bounds for reversible circuits based on Young subgroups (Q2446569) (← links)
- Application of Functional Decomposition in Synthesis of Reversible Circuits (Q2822524) (← links)
- Synthesis and optimization of reversible circuits -- a survey (Q2875110) (← links)
- Realization of a new permutative gate library using controlled-kth-root-of-NOT quantum gates for exact minimization of quantum circuits (Q2935332) (← links)
- A Post-Synthesis Optimization Technique for Reversible Circuits Exploiting Negative Control Lines (Q2982334) (← links)
- (Q5039134) (← links)
- (Q5325296) (← links)
