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

DOI10.1134/S1990478913040133zbMATH Open1324.68050OpenAlexW2088054446MaRDI QIDQ5263823FDOQ5263823

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

computation complexity\(\pi \)-schemelower estimate for complexity

Mathematics Subject Classification ID

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

Cited In (3)

• On the perfectness of minimal regular partitions of the edge set of the $n$-dimensional cube
• Complexity of the Realization of a Linear Boolean Function in the Class of π-Schemes
• Formula Complexity of Ternary Majorities

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)