• Learning read-constant polynomials of constant degree modulo composites 

      Chattopadhyay, Arkadev; Gavaldà Mestre, Ricard; Arnsfelt Hansen, Kristoffer; Thérien, Denis (2014-08)
      Article
      Accés obert
      Boolean functions that have constant degree polynomial representation over a fixed finite ring form a natural and strict subclass of the complexity class ACC0. They are also precisely the functions computable efficiently ...