Pages that link to "Item:Q4522865"
From MaRDI portal
The following pages link to On the complexity of realization of the linear function by formulas over finite Boolean bases (Q4522865):
Displaying 15 items.
- Lower estimates of circuit complexity in the basis of antichain functions (Q355314) (← links)
- 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)
- Realization of systems of Boolean functions by linear arithmetic polynomials with masking (Q1284320) (← links)
- On the complexity of realizing the powers of a Boolean \((n,n)\)-function (Q1345680) (← links)
- Realization of Boolean formulas by uniform multiplexor and majority cascades (Q1390684) (← links)
- Realization of linear functions by formulas in various bases (Q1866895) (← links)
- Realization of Boolean functions by formulas in continuous bases containing a continuum of constants (Q1938644) (← links)
- Complexity of realization of Boolean functions from some classes related to finite grammars by formulas of alternation depth 3 (Q2018028) (← links)
- Formula complexity of a linear function in a \(k\)-ary basis (Q2037681) (← links)
- The generalized complexity of linear Boolean functions (Q2295973) (← links)
- On sets of linear forms of maximal complexity (Q2680709) (← links)
- Bases for \(\mathrm{AC}^{0}\) and other complexity classes (Q2805414) (← links)
- On minimal circuits for linear functions over some bases (Q2852141) (← links)
- (Q3368924) (← links)
