Computation complexity of a ternary linear function

DOI10.1134/S1990478912040011zbMATH Open1324.94067OpenAlexW1979555923MaRDI QIDQ5263770FDOQ5263770

Yu. L. Vasil'ev, Sergey Avgustinovich, 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/s1990478912040011

zbMATH Keywords

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

Mathematics Subject Classification ID

Analytic circuit theory (94C05)

Cited In (4)

• Title not available (Why is that?)
• 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: 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)