Pages that link to "Item:Q332335"
From MaRDI portal
The following pages link to The complexity of the representation of multiple-output Boolean functions (Q332335):
Displaying 8 items.
- An approximate algorithm for computing the complexity of reversible functions in the basis of Toffoli (Q447717) (← links)
- On the multiplicative complexity of Boolean functions and bitsliced higher-order masking (Q1695993) (← links)
- An algorithm for minimization of Boolean functions in the class of Toffoli reversible logic circuits (Q1717423) (← links)
- Behavior of Shannon functions for complexity of parametric representations of Boolean functions (Q1851549) (← links)
- Algebras of binary isolating formulas (Q2066096) (← links)
- The complexity of the descriptiveness of Boolean circuits over different sets of gates (Q2464338) (← links)
- Complexity of Boolean functions' representations in classes of extended pair-generated operator forms (Q2633615) (← links)
- (Q3334980) (← links)