On complexity of representation of multiple-valued logic functions as polarised polynomials

DOI10.1515/dma-2002-0304zbMath1044.03517OpenAlexW2566035368MaRDI QIDQ4809572

Svetlana N. Selezneva

Publication date: 30 August 2004

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

Full work available at URL: https://doi.org/10.1515/dma-2002-0304

zbMATH Keywords

many-valued logic functionsShannon functionspolarised polynomial

Mathematics Subject Classification ID

Many-valued logic (03B50)

Related Items (7)

Complexity of systems of functions of Boolean algebra and systems of functions of three-valued logic in classes of polarized polynomial forms ⋮ Lower bound of the complexity of functions over a finite field of order 4 in the class of polarized polynomials ⋮ Upper bound for the length of functions over a finite field in the class of pseudopolynomials ⋮ Complexity of function systems over a finite field in the class of polarized polynomial forms ⋮ Lower bound for the complexity of five-valued polarized polynomials ⋮ Lower bounds of complexity for polarized polynomials over finite fields ⋮ Lower bound of the complexity of seven-valued functions in the class of polarized polynomials

This page was built for publication: On complexity of representation of multiple-valued logic functions as polarised polynomials