Pages that link to "Item:Q447717"
From MaRDI portal
The following pages link to An approximate algorithm for computing the complexity of reversible functions in the basis of Toffoli (Q447717):
Displaying 3 items.
- The complexity of the representation of multiple-output Boolean functions (Q332335) (← links)
- Estimation of the depth of reversible circuits consisting of NOT, CNOT and 2-CNOT gates (Q334289) (← links)
- An algorithm for minimization of Boolean functions in the class of Toffoli reversible logic circuits (Q1717423) (← links)