The following pages link to (Q2748260):
Displayed 9 items.
- Refined estimates of the number of repetition-free Boolean functions in the full binary basis \(\{\&,\vee,\oplus,-\}\) (Q368209) (← links)
- Asymptotics of the number of repetition-free Boolean functions in the elementary basis (Q941908) (← links)
- On the asymptotics of the number of repetition-free Boolean functions in the basis \(\{\&, \vee, \otimes, \neg\}\) (Q1675524) (← links)
- An algorithm for minimization of Boolean functions in the class of Toffoli reversible logic circuits (Q1717423) (← links)
- On read-once multifunctions in some base (Q2058308) (← links)
- Complexity lower bound for Boolean functions in the class of extended operator forms (Q2306843) (← links)
- Complexity of Boolean functions' representations in classes of extended pair-generated operator forms (Q2633615) (← links)
- On read-once Boolean functions in elementary base extended by median (Q2676822) (← links)
- On Decomposition of Sub-definite Partial Boolean Functions (Q5852964) (← links)