scientific article; zbMATH DE number 3328172

zbMath0206.29004MaRDI QIDQ5606601

V. M. Khrapchenko

Publication date: 1971

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Related Items

Depth and polynomial equivalence of formulas for closed classes of two- valued logic, Sufficient conditions for the local repetition-freeness of minimal π-schemes realizing linear Boolean functions, Complexity of the Realization of a Linear Boolean Function in the Class of π-Schemes, The complexity of the realization of symmetrical functions by formulae, Representation of monomials as a sum of powers of linear forms, Lower bounds for the size of expressions for certain functions in d-ary logic, Method of determining lower bounds for the complexity of \(\Pi\)-circuits