Pages that link to "Item:Q2295973"
From MaRDI portal
The following pages link to The generalized complexity of linear Boolean functions (Q2295973):
Displaying 14 items.
- Complexity of realization of a linear Boolean function in Sheffer's basis (Q355321) (← links)
- Lower bounds on the formula complexity of a linear Boolean function (Q891988) (← links)
- General upper bound of circuit complexity in an arbitrary infinite complete base (Q1275996) (← links)
- On the complexity of realizing the powers of a Boolean \((n,n)\)-function (Q1345680) (← links)
- Complexity of Boolean functions over bases with unbounded fan-in gates (Q1350754) (← links)
- Realization of linear functions by formulas in various bases (Q1866895) (← links)
- Sequential computation of linear Boolean mappings (Q1884927) (← links)
- Formula complexity of a linear function in a \(k\)-ary basis (Q2037681) (← links)
- Implementation complexity of Boolean functions with a small number of ones (Q2050236) (← links)
- On the comparison of complexity of two ways of realization of some linear Boolean functions (Q3125954) (← links)
- (Q4036699) (← links)
- (Q4359107) (← links)
- On the complexity of realization of the linear function by formulas over finite Boolean bases (Q4522865) (← links)
- Complexity of Linear Boolean Operators (Q5396765) (← links)