On the Complexity of Some Arithmetic Problems over IF 2 [ T ]


In this paper, we study various combinatorial complexity characteristics of Boolean functions related to some natural arithmetic problems about polynomials over IF2 . In particular, we consider the Boolean function deciding whether a given polynomial over IF2 is squarefree. We obtain an exponential lower bound on the size of a decision tree for this… (More)


  • Presentations referencing similar topics