On the complexity of generalized polynomials of \(k\)-valued functions

DOI10.3103/S0278641908030060zbMath1168.03321OpenAlexW2051930954MaRDI QIDQ2519399

Aleksandr B. Dainyak, Svetlana N. Selezneva

Publication date: 26 January 2009

Published in: Moscow University Computational Mathematics and Cybernetics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3103/s0278641908030060

zbMATH Keywords

\(k\)-valued functionsgeneralized polynomialsPost negations

Mathematics Subject Classification ID

Boolean functions (06E30) Many-valued logic (03B50)

Related Items (3)

Complexity of systems of functions of Boolean algebra and systems of functions of three-valued logic in classes of polarized polynomial forms ⋮ Upper bound for the length of functions over a finite field in the class of pseudopolynomials ⋮ On the complexity of representation of k-valued functions by generalised polarised polynomials

Cites Work

• Graphs of Linear Forms on Modules over Boolean Rings

This page was built for publication: On the complexity of generalized polynomials of \(k\)-valued functions