Weizmann Logo
ECCC
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style



REPORTS > DETAIL:

Paper:

TR19-100 | 31st July 2019 18:30

Nonnegative rank measures and monotone algebraic branching programs

RSS-Feed




TR19-100
Authors: Hervé Fournier, Guillaume Malod, Maud Szusterman, Sébastien Tavenas
Publication: 31st July 2019 19:19
Downloads: 1121
Keywords: 


Abstract:

Inspired by Nisan's characterization of noncommutative complexity (Nisan 1991), we study different notions of nonnegative rank, associated complexity measures and their link with monotone computations. In particular we answer negatively an open question of Nisan asking whether nonnegative rank characterizes monotone noncommutative complexity for algebraic branching programs. We also prove a rather tight lower bound for the computation of elementary symmetric polynomials by algebraic branching programs in the monotone setting or, equivalently, in the homogeneous syntactically multilinear setting.



ISSN 1433-8092 | Imprint