Multiaffine polynomials over a finite field

DOI10.1515/DMA-2021-0038MaRDI QIDQ2064385zbMATH OpenOpenAlexFDO

Authors 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

algorithmcomplexityfinite fieldmultiaffinitypolynomialpolynomial algorithmsystem of linear equations over finite field

Mathematics Subject Classification ID

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

Recommendations

• Multiaffinity testing of Boolean functions using their Zhegalkin polynomials
• Automata, Languages and Programming
• Solving some affine equations over finite fields
• scientific article; zbMATH DE number 1303541
• Learning sparse multivariate polynomials over a field with queries and counterexamples.

Cites work

• An enhanced algorithm to search for low-degree annihilators for a Zhegalkin polynomial
• Complexity classifications of Boolean constraint satisfaction problems
• scientific article; zbMATH DE number 3882549 (Why is no real title available?)
• On some algorithms for constructing low-degree annihilators for Boolean functions

Cited in

(5)

• Products with variables from low-dimensional affine spaces and shifted power identity testing in finite fields
• Multiaffinity testing of Boolean functions using their Zhegalkin polynomials
• Multiplication of Polynomials over Finite Fields
• On properties of multiaffine predicates on a finite set
• Deciding multiaffinity of polynomials over a finite field

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

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