On the complexity of polarised polynomials of multi-valued logic functions in one variable

DOI10.1515/1569392031905539zbMath1121.03033OpenAlexW2163650357MaRDI QIDQ4825182

Svetlana N. Selezneva

Publication date: 27 October 2004

Published in: Discrete Mathematics and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1515/1569392031905539

Mathematics Subject Classification ID

Many-valued logic (03B50)

Related Items (5)

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 ⋮ Complexity of function systems over a finite field in the class of polarized polynomial forms ⋮ A lower estimate of the complexity of three-valued logic functions in the class of polarized polynomials

This page was built for publication: On the complexity of polarised polynomials of multi-valued logic functions in one variable