Lower bound for the complexity of five-valued polarized polynomials
DOI10.1515/DMA-2017-0029zbMATH Open1406.11120OpenAlexW2763549749MaRDI QIDQ1744288FDOQ1744288
Authors: Aleksandr Sergeevich Baliuk, Anna Sergeevna Zinchenko 
Publication date: 23 April 2018
Published in: Discrete Mathematics and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1515/dma-2017-0029
Recommendations
- Lower bound of the complexity of seven-valued functions in the class of polarized polynomials
- On the complexity of representation of \(k\)-valued functions by generalised polarised polynomials
- Lower bound of the complexity of functions over a finite field of order 4 in the class of polarized polynomials
- Lower bounds of complexity for polarized polynomials over finite fields
- On complexity of representation of multiple-valued logic functions as polarised polynomials
Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Finite fields and commutative rings (number-theoretic aspects) (11T99) Number-theoretic algorithms; complexity (11Y16)
Cites Work
- A lower estimate of the complexity of three-valued logic functions in the class of polarized polynomials
- Complexity of Boolean functions in the class of polarized polynomial forms
- On complexity of representation of multiple-valued logic functions as polarised polynomials
- Upper bounds of the complexity of functions over finite fields in some classes of Kronecker forms
Cited In (4)
This page was built for publication: Lower bound for the complexity of five-valued polarized polynomials
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1744288)
