Multiaffine polynomials over a finite field

DOI10.1515/dma-2021-0038OpenAlexW4285507910MaRDI QIDQ2064385

Svetlana N. Selezneva

Publication date: 5 January 2022

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

Full work available at URL: https://doi.org/10.1515/dma-2021-0038

zbMATH Keywords

complexityalgorithmfinite fieldpolynomialpolynomial algorithmmultiaffinitysystem of linear equations over finite field

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Polynomials over finite fields (11T06) Boolean functions (06E30)

Related Items (2)

Multiaffinity testing of Boolean functions using their Zhegalkin polynomials ⋮ On properties of multiaffine predicates on a finite set

Cites Work

• Unnamed Item
• Complexity Classifications of Boolean Constraint Satisfaction Problems
• On some algorithms for constructing low-degree annihilators for Boolean functions
• An enhanced algorithm to search for low-degree annihilators for a Zhegalkin polynomial

This page was built for publication: Multiaffine polynomials over a finite field