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

DOI10.1515/DMA-2002-0304MaRDI QIDQ4809572zbMATH OpenOpenAlexFDO

Authors 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

Shannon functionsmany-valued logic functionspolarised polynomial

Mathematics Subject Classification ID

Many-valued logic (03B50)

Recommendations

• On the complexity of polarised polynomials of multi-valued logic functions in one variable
• On the complexity of representation of \(k\)-valued functions by generalised polarised polynomials
• Complexity of Boolean functions in the class of polarized polynomial forms
• Complexity of systems of functions of Boolean algebra and systems of functions of three-valued logic in classes of polarized polynomial forms
• Complexity of Boolean functions in the class of canonical polarized polynomials

Cited in

(13)

• Lower bound for the complexity of five-valued polarized polynomials
• A method for constructing polynomials of k-valued logic functions
• scientific article; zbMATH DE number 3995630 (Why is no real title available?)
• On the complexity of polarised polynomials of multi-valued logic functions in one variable
• Complexity of systems of functions of Boolean algebra and systems of functions of three-valued logic in classes of polarized polynomial forms
• On the length of functions of \(k\)-valued logic in the class of polynomial normal forms modulo \(k\)
• 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 Boolean functions in the class of polarized polynomial forms
• 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
• Lower bound of the complexity of seven-valued functions in the class of polarized polynomials
• Lower bounds of complexity for polarized polynomials over finite fields

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4809572)