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

DOI10.1515/1569392031905539MaRDI QIDQ4825182zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• On complexity of representation of multiple-valued logic functions as polarised polynomials
• On the complexity of representation of \(k\)-valued functions by generalised polarised polynomials
• Complexity of Boolean functions in the class of canonical polarized 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

Cited in

(7)

• On complexity of representation of multiple-valued logic functions as polarised polynomials
• Complexity of Boolean functions in the class of canonical polarized polynomials
• 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
• A lower estimate of the complexity of three-valued logic functions in the class of polarized polynomials
• 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

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

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