The Rectangle Covering Number of Random Boolean Matrices

被引：0
|
作者：
Pourmoradnasseri, Mozhgan [1 ]
Theis, Dirk Oliver [1 ]
机构：
[1] Univ Tartu, Inst Comp Sci, Ulikooli 17, EE-51014 Tartu, Estonia
来源：
ELECTRONIC JOURNAL OF COMBINATORICS | 2017年 / 24卷 / 02期
关键词：
BOUNDS; COMPLEXITY; RANK;
D O I：
暂无
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
The rectangle covering number of an n x n Boolean matrix M is the smallest number of 1-rectangles which are needed to cover all the 1-entries of M. Its binary logarithm is the Nondeterministic Communication Complexity, and it equals the chromatic number of a graph G boxed times(M) obtained from M by a construction of Lovasz and Saks. We determine the rectangle covering number and related parameters (clique size, independence ratio, fractional chromatic number of G boxed times(M)) of random Boolean matrices, where each entry is 1 with probability p = p (n), and the entries are independent.
引用
收藏
页数：32
相关论文
共 50 条
  • [41] On the number of real eigenvalues of a product of truncated orthogonal random matrices
    Little, Alex
    Mezzadri, Francesco
    Simm, Nick
    ELECTRONIC JOURNAL OF PROBABILITY, 2022, 27
  • [42] On the number of k-cycles in the assignment problem for random matrices
    Esteve, Jose G.
    Falceto, Fernando
    JOURNAL OF STATISTICAL MECHANICS-THEORY AND EXPERIMENT, 2008,
  • [43] Numerically stable real number codes based on random matrices
    Chen, ZZ
    Dongarra, J
    COMPUTATIONAL SCIENCE - ICCS 2005, PT 1, PROCEEDINGS, 2005, 3514 : 115 - 122
  • [44] Maximum exponent of boolean circulant matrices with constant number of nonzero entries in their generating vector
    Bueno, M. I.
    Furtado, S.
    Sherer, N.
    ELECTRONIC JOURNAL OF COMBINATORICS, 2009, 16 (01):
  • [45] Hardness of approximation for orthogonal rectangle packing and covering problems
    Chlebik, Miroslav
    Chlebikova, Janka
    JOURNAL OF DISCRETE ALGORITHMS, 2009, 7 (03) : 291 - 305
  • [46] Limit distribution of the number of solutions of a system of random Boolean equations with a linear part
    Masol V.I.
    Ukrainian Mathematical Journal, 1998, 50 (9) : 1389 - 1404
  • [47] Analysis and Improvement of True Random Number Generator Based on Autonomous Boolean Network
    Dong, Lihua
    Yang, Hui
    Zeng, Yong
    2017 13TH INTERNATIONAL CONFERENCE ON COMPUTATIONAL INTELLIGENCE AND SECURITY (CIS), 2017, : 243 - 247
  • [48] The covering number and the transitive covering number may be totally different
    Jan Kraszewski
    Acta Mathematica Hungarica, 2004, 105 : 115 - 119
  • [49] The covering number and the transitive covering number may be totally different
    Kraszewski, J
    ACTA MATHEMATICA HUNGARICA, 2004, 105 (1-2) : 115 - 119
  • [50] Number of guards needed by a museum: A phase transition in vertex covering of random graphs
    Weigt, M
    Hartmann, AK
    PHYSICAL REVIEW LETTERS, 2000, 84 (26) : 6118 - 6121
12345