Deciding multiaffinity of polynomials over a finite field

DOI10.1515/DMA-2024-0020MaRDI QIDQ6599832zbMATH OpenFDO

Authors Svetlana N. Selezneva

Publication date 6 September 2024

Published in Discrete Mathematics and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1515/DMA-2024-0020

zbMATH Keywords

algorithmcomplexityfinite fieldmultiaffinitypolynomialpolynomial algorithmsystem of linear equations over finite field

Mathematics Subject Classification ID

Polynomials over finite fields (11T06) Number-theoretic algorithms; complexity (11Y16) Computational methods for problems pertaining to field theory (12-08) Finite fields (field-theoretic aspects) (12E20)

Recommendations

• Multiaffine polynomials over a finite field
• Multiaffinity testing of Boolean functions using their Zhegalkin polynomials
• Automata, Languages and Programming
• Complexity of the satisfiability problem for multilinear forms over a finite field
• Learning sparse multivariate polynomials over a field with queries and counterexamples.

Cites work

• scientific article; zbMATH DE number 3882549 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 1077209 (Why is no real title available?)
• Multiaffine polynomials over a finite field
• Multiaffinity testing of Boolean functions using their Zhegalkin polynomials

This page was built for publication: Deciding multiaffinity of polynomials over a finite field

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