196 search results - page 40 / 40 » Connected Coloring Completion for General Graphs: Algorithms... |
STOC
2010
ACM
14 years 3 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...