Upper bound for the length of functions over a finite field in the class of pseudopolynomials

DOI10.1134/S0965542517050116zbMath1382.06005OpenAlexW2623457905MaRDI QIDQ2401117

Svetlana N. Selezneva

Publication date: 31 August 2017

Published in: Computational Mathematics and Mathematical Physics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s0965542517050116

zbMATH Keywords

upper boundlengthpolynomial formexclusive-OR sum of pseudoproductsfunction over a finite field

Mathematics Subject Classification ID

Related Items (1)

Complexity lower bound for Boolean functions in the class of extended operator forms

Cites Work

• Unnamed Item
• Unnamed Item
• On upper bound of the complexity of quasi polynomial representations of functions over finite fields
• On the length of functions of \(k\)-valued logic in the class of polynomial normal forms modulo \(k\)
• Upper bounds of the complexity of functions over finite fields in some classes of Kronecker forms
• 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 the length of Boolean functions in the class of exclusive-OR sums of pseudoproducts
• On the complexity of generalized polynomials of \(k\)-valued functions
• On the complexity of representation of k-valued functions by generalised polarised polynomials
• On complexity of representation of multiple-valued logic functions as polarised polynomials
• On the complexity of polarised polynomials of multi-valued logic functions in one variable
• Complexity of Boolean functions in the class of canonical polarized polynomials
• An upper bound for complexity of polynomial normal forms of Boolean functions

This page was built for publication: Upper bound for the length of functions over a finite field in the class of pseudopolynomials