The following pages link to (Q5263827):
Displaying 9 items.
- Upper estimate of realization complexity of linear functions in a basis consisting of multi-input elements (Q255774) (← links)
- Complexity of realization of a linear Boolean function in Sheffer's basis (Q355321) (← links)
- A shortest 2-basis for Boolean algebra in terms of the Sheffer stroke (Q1431337) (← links)
- Complexity and structure of circuits for parity functions (Q1791765) (← links)
- Lower bound of circuit complexity of parity function in a basis of unbounded fan-in (Q2131416) (← links)
- The generalized complexity of linear Boolean functions (Q2295973) (← links)
- The minimal circuits for linear Boolean functions (Q2513252) (← links)
- On minimal circuits for linear functions over some bases (Q2852141) (← links)
- New Minimal Linear Inferences in Boolean Logic Independent of Switch and Medial (Q6159929) (← links)
