A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is `application/pdf`

.

##
###
On the Symmetries of and Equivalence Test for Design Polynomials

2019
*
International Symposium on Mathematical Foundations of Computer Science
*

In a Nisan-Wigderson design polynomial (in short, a design polynomial), every pair of monomials share a few common variables. A useful example of such a polynomial, introduced in [34], is the following: where d is a prime, F d is the finite field with d elements, and k d. The degree of the gcd of every pair of monomials in NW d,k is at most k. For concreteness, we fix k = √ d . The family of polynomials N W := {NW d,k : d is a prime} and close variants of it have been used as hard explicit

doi:10.4230/lipics.mfcs.2019.53
dblp:conf/mfcs/GuptaS19
fatcat:46awkhafpfghhnr5p47z6kc4gq