Pages that link to "Item:Q2002473"

The following pages link to Lower bounds of complexity for polarized polynomials over finite fields (Q2002473):

Displaying 2 items.

• On polynomials with symmetric Galois group which are easy to compute (Q1098889) (← links)
• Complexity lower bound for Boolean functions in the class of extended operator forms (Q2306843) (← links)