On the complexity of Boolean matrix ranks

Linear Algebra and Its Applications - Tập 439 - Trang 2500-2502 - 2013
Yaroslav Shitov1
1National Research University, Higher School of Economics, 20 Myasnitskaya Ulitsa, Moscow 101000, Russia

Tài liệu tham khảo

van den Boom, 2002, Properties of MPC for max-plus-linear systems, Eur. J. Control, 8, 453, 10.3166/ejc.8.453-462 Butkovic, 2003, Max-algebra: the linear algebra of combinatorics?, Linear Algebra Appl., 367, 313, 10.1016/S0024-3795(02)00655-9 Butkovic, 1994, Strong regularity of matrices – a survey of results, Discrete Appl. Math., 48, 45, 10.1016/0166-218X(92)00104-T Butkovic, 1985, A condition for the strong regularity of matrices in the minimax algebra, Discrete Appl. Math., 11, 209, 10.1016/0166-218X(85)90073-3 Cuninghame-Green, 1979, Minimax Algebra, vol. 166 De Schutter, 1996 Develin, 2005, On the rank of a tropical matrix, Comb. Comput. Geom., 52, 213 Dietzfelbinger, 1996, A comparison of two lower-bound methods for communication complexity, Theoret. Comput. Sci., 168, 39, 10.1016/S0304-3975(96)00062-X Fiorini, 2013, Combinatorial bounds on nonnegative rank and extended formulations, Discrete Math., 313, 67, 10.1016/j.disc.2012.09.015 Friesen Gaubert, 1997, Methods and applications of (max,+) linear algebra, 261 Kim