The following pages link to (Q5606601):
Displayed 7 items.
- Depth and polynomial equivalence of formulas for closed classes of two- valued logic (Q1097251) (← links)
- The complexity of the realization of symmetrical functions by formulae (Q1215614) (← links)
- Lower bounds for the size of expressions for certain functions in d-ary logic (Q1230507) (← links)
- Representation of monomials as a sum of powers of linear forms (Q2018019) (← links)
- Method of determining lower bounds for the complexity of \(\Pi\)-circuits (Q2550627) (← links)
- Sufficient conditions for the local repetition-freeness of minimal π-schemes realizing linear Boolean functions (Q3186844) (← links)
- Complexity of the Realization of a Linear Boolean Function in the Class of π-Schemes (Q4558295) (← links)