Multiaffinity testing of Boolean functions using their Zhegalkin polynomials

DOI10.3103/S027864192201006XzbMath1498.94117OpenAlexW4229035276MaRDI QIDQ2673146

Svetlana N. Selezneva

Publication date: 9 June 2022

Published in: Moscow University Computational Mathematics and Cybernetics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3103/s027864192201006x

zbMATH Keywords

complexityalgorithmBoolean functionZhegalkin polynomialmultiaffinityfunction of logical algebra

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Boolean functions (94D10)

Cites Work

• Unnamed Item
• Unnamed Item
• Multiaffine polynomials over a finite field
• Complexity Classifications of Boolean Constraint Satisfaction Problems
• The complexity of satisfiability problems

This page was built for publication: Multiaffinity testing of Boolean functions using their Zhegalkin polynomials