Sufficient conditions for the local repetition-freeness of minimal π-schemes realizing linear Boolean functions

DOI10.1134/S1990478915040146zbMath1349.94171OpenAlexW2274944239MaRDI QIDQ3186844

K. L. Rychkov

Publication date: 12 August 2016

Published in: Journal of Applied and Industrial Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s1990478915040146

zbMATH Keywords

formula complexity\(\pi \)-schemelower bound on the complexity

Mathematics Subject Classification ID

Related Items (3)

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 ⋮ Unnamed Item

Cites Work

• Lower bounds on the formula complexity of a linear Boolean function
• Applications of matrix methods to the theory of lower bounds in computational complexity
• Monotone Circuits for Connectivity Require Super-Logarithmic Depth
• The Shrinkage Exponent of de Morgan Formulas is 2
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Sufficient conditions for the local repetition-freeness of minimal π-schemes realizing linear Boolean functions