Under the auspices of the Computational Complexity Foundation (CCF)

REPORTS > DETAIL:

### Paper:

TR12-061 | 16th May 2012 10:35

#### Formulas are exponentially stronger than monotone circuits in non-commutative setting

TR12-061
Authors: Pavel Hrubes, Amir Yehudayoff
Publication: 16th May 2012 10:43