Deciding multiaffinity of polynomials over a finite field

DOI10.1515/DMA-2024-0020MaRDI QIDQ6599832

Svetlana N. Selezneva

Publication date: 6 September 2024

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

zbMATH Keywords

complexityalgorithmfinite fieldpolynomialpolynomial algorithmmultiaffinitysystem of linear equations over finite field

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• 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)