3 search results - page 1 / 1 » Lower Bounds for the Determinantal Complexity of Explicit Lo... |
CSR
2009
Springer
13 years 11 months ago
2009
Springer
STOC
2010
ACM
14 years 2 months ago
2010
ACM
We initiate a direction for proving lower bounds on the size of non-commutative arithmetic circuits. This direction is based on a connection between lower bounds on the size of no...
ECCC
2010
13 years 3 months ago
2010
We study the problem of testing isomorphism (equivalence up to relabelling of the variables) of two Boolean functions f, g : {0, 1}n → {0, 1}. Our main focus is on the most stud...