Computation complexity of a ternary linear function

DOI10.1134/S1990478912040011MaRDI QIDQ5263770zbMATH OpenOpenAlexFDO

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

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/s1990478912040011

zbMATH Keywords

computation complexitygeneralized \(\pi \)-schemeternary linear function

Mathematics Subject Classification ID

Analytic circuit theory (94C05)

Cited in

(4)

• Complexity of the realization of a linear Boolean function in the class of \(\pi\)-schemes
• Representations of normalized formulas
• On the perfectness of minimal regular partitions of the edge set of the \(n\)-dimensional cube
• Formula Complexity of Ternary Majorities

This page was built for publication: 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 Q5263770)