A lower estimate for the computation complexity of a ternary linear function

DOI10.1134/S1990478913040133MaRDI QIDQ5263823zbMATH OpenOpenAlexFDO

Authors Yu. L. Vasil'ev, K. L. Rychkov

Publication date 17 July 2015

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

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

zbMATH Keywords

\(\pi \)-schemecomputation complexitylower estimate for complexity

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Cited in

(3)

• Formula Complexity of Ternary Majorities
• 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

This page was built for publication: A lower estimate for the computation complexity of a ternary linear function

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