Pages that link to "Item:Q355321"
From MaRDI portal
The following pages link to Complexity of realization of a linear Boolean function in Sheffer's basis (Q355321):
Displaying 5 items.
- A shortest 2-basis for Boolean algebra in terms of the Sheffer stroke (Q1431337) (← links)
- Realization of linear functions by formulas in various bases (Q1866895) (← links)
- The generalized complexity of linear Boolean functions (Q2295973) (← links)
- Polynomial-time quantum algorithms for finding the linear structures of Boolean function (Q2347659) (← links)
- (Q5263827) (← links)