Multiaffine polynomials over a finite field
type: Item
instance of: scholarly article
title: Multiaffine polynomials over a finite field
published in: Discrete Mathematics and Applications
publication date: 2022-01-05T00:00:00Z
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 06E30
Mathematics Subject Classification ID: 11T06
zbMATH DE Number: 7452435
zbMATH Keywords: finite field
zbMATH Keywords: polynomial
zbMATH Keywords: multiaffinity
zbMATH Keywords: system of linear equations over finite field
zbMATH Keywords: algorithm
zbMATH Keywords: complexity
zbMATH Keywords: polynomial algorithm
author: Svetlana N. Selezneva
MaRDI profile type: Publication
full work available at URL: dma-2021-0038
OpenAlex ID: W4285507910
cites work: Complexity classifications of Boolean constraint satisfaction problems
cites work: Q3216750
cites work: On some algorithms for constructing low-degree annihilators for Boolean functions
cites work: An enhanced algorithm to search for low-degree annihilators for a Zhegalkin polynomial
DOI: 10.1515/DMA-2021-0038
description: scientific article; zbMATH DE number 7452435