Nonnegative rank measures and monotone algebraic branching programs - Archive ouverte HAL Access content directly
Conference Papers Year : 2019

Nonnegative rank measures and monotone algebraic branching programs

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.
Fichier principal
Vignette du fichier
monotone.pdf (334.68 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-02404630 , version 1 (11-12-2019)

Identifiers

  • HAL Id : hal-02404630 , version 1

Cite

Hervé Fournier, Guillaume Malod, Maud Szusterman, Sébastien Tavenas. Nonnegative rank measures and monotone algebraic branching programs. FSTTCS, Dec 2019, Mumbai, India. pp.15:1--15:14. ⟨hal-02404630⟩
195 View
148 Download

Share

Gmail Facebook X LinkedIn More