@inproceedings{44d45fd1914e428c849a94b06f5f49ff,
title = "Formulas are exponentially stronger than monotone circuits in non-commutative setting",
abstract = "We give an example of a non-commutative mono-tone polynomial f which can be computed by a polynomial-size non-commutative formula, but every monotone non-commutative circuit computing f must have an exponential size. In the non-commutative setting this gives, a fortiori, an exponential separation between monotone and general formulas, monotone and general branching programs, and monotone and general circuits. This answers some questions raised by Nisan.",
keywords = "algebraic complexity, disjointness, monotone computation",
author = "Pavel Hrube and Amir Yehudayoff",
year = "2013",
doi = "10.1109/CCC.2013.11",
language = "الإنجليزيّة",
isbn = "9780769549972",
series = "Proceedings of the Annual IEEE Conference on Computational Complexity",
pages = "10--14",
booktitle = "Proceedings - 2013 IEEE Conference on Computational Complexity, CCC 2013",
note = "2013 IEEE Conference on Computational Complexity, CCC 2013 ; Conference date: 05-06-2013 Through 07-06-2013",
}