On the complexity of representation of k-valued functions by generalised polarised polynomials

DOI10.1515/DMA.2009.045zbMath1235.03058OpenAlexW2042560194MaRDI QIDQ3225903

Svetlana N. Selezneva

Publication date: 23 March 2012

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

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

zbMATH Keywords

\(k\)-valued logic functionsShannon functionsgeneralised polarised polynomials

Mathematics Subject Classification ID

Many-valued logic (03B50)

Related Items (3)

On upper bounds of the complexity of functions over nonprime finite fields in some classes of polarized polynomials ⋮ Upper bounds of the complexity of functions over finite fields in some classes of Kronecker forms ⋮ Upper bound for the length of functions over a finite field in the class of pseudopolynomials

Cites Work

• Complexity of Boolean functions in the class of polarized polynomial forms
• On the complexity of generalized polynomials of \(k\)-valued functions
• On the complexity of polarised polynomials of multi-valued logic functions in one variable
• An upper bound for complexity of polynomial normal forms of Boolean functions

This page was built for publication: On the complexity of representation of k-valued functions by generalised polarised polynomials