Publication:5606601
From MaRDI portal
zbMath0206.29004MaRDI QIDQ5606601
Publication date: 1971
68Q25: Analysis of algorithms and problem complexity
Related Items
Complexity of the Realization of a Linear Boolean Function in the Class of π-Schemes, Depth and polynomial equivalence of formulas for closed classes of two- valued logic, The complexity of the realization of symmetrical functions by formulae, Lower bounds for the size of expressions for certain functions in d-ary logic, Representation of monomials as a sum of powers of linear forms, Method of determining lower bounds for the complexity of \(\Pi\)-circuits, Sufficient conditions for the local repetition-freeness of minimal π-schemes realizing linear Boolean functions