scientific article; zbMATH DE number 3354614

zbMath0223.68009MaRDI QIDQ5629239

V. M. Khrapchenko

Publication date: 1971

Full work available at URL: http://mathnet.ru/eng/mz/v10/i1/p83

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

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Related Items (17)

Quantified Derandomization: How to Find Water in the Ocean ⋮ 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 ⋮ On the perfectness of minimal regular partitions of the edge set of the $n$-dimensional cube ⋮ Algorithms and lower bounds for comparator circuits from shrinkage ⋮ Smallest Formulas for Parity of 2 k Variables Are Essentially Unique ⋮ Improved Average-Case Lower Bounds for De Morgan Formula Size: Matching Worst-Case Lower Bound ⋮ Upper bounds for the formula size of symmetric Boolean functions ⋮ On algorithm complexity ⋮ ON THE MEANING OF WORKS BY V. M. KHRAPCHENKO ⋮ The complexity of the realization of symmetrical functions by formulae ⋮ Fourier concentration from shrinkage ⋮ Smallest formulas for the parity of \(2^k\) variables are essentially unique ⋮ Lower bounds for the size of expressions for certain functions in d-ary logic ⋮ The circuit depth of symmetric Boolean functions ⋮ $$P\mathop{ =}\limits^{?}NP$$ ⋮ Shallow circuits and concise formulae for multiple addition and multiplication

This page was built for publication: