论文信息 - On the complexity of Boolean matrix ranks - 字舞流文

On the complexity of Boolean matrix ranks

Abstract We present a reduction which shows that the fooling set number, tropical and determinantal ranks of a Boolean matrix are NP-hard to compute.

Yaroslav Shitov

[1] Fred W. Roush,et al. Factorization of polynomials in one variable over the tropical semiring , 2005 .

[2] Robin Thomas,et al. PERMANENTS, PFAFFIAN ORIENTATIONS, AND EVEN DIRECTED CIRCUITS , 1997, STOC 1997.

[3] Stéphane Gaubert,et al. Methods and Applications of (MAX, +) Linear Algebra , 1997, STACS.

[4] Bart De Schutter,et al. Properties of MPC for Max-Plus-Linear Systems , 2002, Eur. J. Control.

[5] B. Schutter. "Max-Algebraic System Theory for Discrete Event Systems" , 1996 .

[6] Peter Butkovic,et al. Strong Regularity of Matrices - A Survey of Results , 1994, Discret. Appl. Math..

[7] Dirk Oliver Theis,et al. Fooling-sets and rank in nonzero characteristic , 2013, CTW.

[8] Peter Butkovič,et al. Max-Algebra - the Linear Algebra of Combinatorics? , 2002 .

[9] Martin Dietzfelbinger,et al. A Comparison of Two Lower-Bound Methods for Communication Complexity , 1994, Theor. Comput. Sci..

[10] Samuel Fiorini,et al. Combinatorial bounds on nonnegative rank and extended formulations , 2011, Discret. Math..

[11] B. Sturmfels,et al. On the rank of a tropical matrix , 2003 .

[12] Peter Butkovič,et al. A condition for the strong regularity of matrices in the minimax algebra , 1985, Discret. Appl. Math..