Now showing items 1-1 of 1

    • Polynomials over finite rings and complexity classes 

      Surowka, Robert (2014)
      Polynomials modulo composite numbers are at the frontier of what is known in classical computational complexity. They correspond to the class ACC 0 of languages represented by constant-depth polynomial-sized circuits of ...