On the structure of one class of perfect \(\Pi \)-partitions

DOI10.33048/SEMI.2023.20.093MaRDI QIDQ6587479

K. L. Rychkov

Publication date: 14 August 2024

Published in: Sibirskie Elektronnye Matematicheskie Izvestiya (Search for Journal in Brave)

zbMATH Keywords

Boolean functionslower bounds on complexity\( \pi \)-schemesformula representationnormalized formulas

Mathematics Subject Classification ID

Complexity of computation (including implicit computational complexity) (03D15)

Cites Work

• Lower bounds on the formula complexity of a linear Boolean function
• On the perfectness of minimal regular partitions of the edge set of the $n$-dimensional cube
• A simplified proof of a lower complexity estimate
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

This page was built for publication: On the structure of one class of perfect \(\Pi \)-partitions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6587479)