On the perfectness of minimal regular partitions of the edge set of the $n$-dimensional cube

DOI10.33048/daio.2019.26.662zbMath1492.05128OpenAlexW4240451779MaRDI QIDQ5090139

K. L. Rychkov

Publication date: 15 July 2022

Published in: Diskretnyi analiz i issledovanie operatsii (Search for Journal in Brave)

Full work available at URL: http://mathnet.ru/eng/da938

zbMATH Keywords

Boolean functionlower complexity bound\( \pi \)-schemeregular partition of the edge set of \(n\)-dimensional cube

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Complexity of the realization of a linear function in the class of \(\Pi\)-circuits
• Applications of matrix methods to the theory of lower bounds in computational complexity
• Sufficient conditions for the local repetition-freeness of minimal π-schemes realizing linear Boolean functions
• Monotone Circuits for Connectivity Require Super-Logarithmic Depth
• The Shrinkage Exponent of de Morgan Formulas is 2
• Complexity of the Realization of a Linear Boolean Function in the Class of π-Schemes
• Computation complexity of a ternary linear function
• A lower estimate for the computation complexity of a ternary linear function
• A simplified proof of a lower complexity estimate

This page was built for publication: On the perfectness of minimal regular partitions of the edge set of the $n$-dimensional cube