Browsing Computer Science and Automation (CSA) by Subject "Arithmetic Circuit Complexity"
Now showing items 1-1 of 1
-
Towards a Charcterization of the Symmetries of the Nisan-Wigderson Polynomial Family
(2018-07-09)Understanding the structure and complexity of a polynomial family is a fundamental problem of arithmetic circuit complexity. There are various approaches like studying the lower bounds, which deals with nding the smallest ...