On upper bound of the complexity of quasi polynomial representations of functions over finite fields

zbMath1392.11091MaRDI QIDQ307745

Aleksandr Sergeevich Balyuk

Publication date: 5 September 2016

Published in: Izvestiya Irkutskogo Gosudarstvennogo Universiteta. Seriya Matematika (Search for Journal in Brave)

zbMATH Keywords

complexityfinite fieldpolynomialquasi polynomial

Mathematics Subject Classification ID

Number-theoretic algorithms; complexity (11Y16) Polynomials over finite fields (11T06)

Related Items (1)

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

This page was built for publication: On upper bound of the complexity of quasi polynomial representations of functions over finite fields