Lower bound of the complexity of functions over a finite field of order 4 in the class of polarized polynomials
zbMATH Open1348.11097MaRDI QIDQ332332FDOQ332332
Authors: Aleksandr Sergeevich Baliuk, Anna Sergeevna Zinchenko
Publication date: 8 November 2016
Published in: The Bulletin of Irkutsk State University. Series Mathematics (Search for Journal in Brave)
Full work available at URL: http://isu.ru/journal/downloadArticle?article=_81ead9fa86c04dc7aac69969376f9766&lang=rus
Recommendations
- Lower bounds of complexity for polarized polynomials over finite fields
- On upper bounds of the complexity of functions over nonprime finite fields in some classes of polarized polynomials
- Complexity of function systems over a finite field in the class of polarized polynomial forms
- Lower bounds for the complexity of polynomials
- scientific article; zbMATH DE number 619540
- STACS 2005
- A Lower Bound on the Complexity of Polynomial Multiplication over Finite Fields
- On lower bounds for the complexity of polynomials and their multiples
- On upper bound of the complexity of quasi polynomial representations of functions over finite fields
- Lower bound of the complexity of seven-valued functions in the class of polarized polynomials
Polynomials over finite fields (11T06) Finite fields and commutative rings (number-theoretic aspects) (11T99) Number-theoretic algorithms; complexity (11Y16)
Cites Work
- Title not available (Why is that?)
- 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 (8)
- On upper bounds of the complexity of functions over nonprime finite fields in some classes of polarized polynomials
- Lower bound for the complexity of five-valued polarized polynomials
- On the representation of rational functions of bounded complexity
- On upper bound of the complexity of quasi polynomial representations of functions over finite fields
- Upper bounds of the complexity of functions over finite fields in some classes of Kronecker forms
- 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: Lower bound of the complexity of functions over a finite field of order 4 in the class of polarized polynomials
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q332332)