The following pages link to Anastasiya Sergeevna Frantseva (Q332334):
Displaying 4 items.
- The complexity of the representation of multiple-output Boolean functions (Q332335) (← links)
- An approximate algorithm for computing the complexity of reversible functions in the basis of Toffoli (Q447717) (← links)
- An algorithm for minimization of Boolean functions in the class of Toffoli reversible logic circuits (Q1717423) (← links)
- Complexity of Boolean functions' representations in classes of extended pair-generated operator forms (Q2633615) (← links)
