LOPSIDED LOVASZ LOCAL LEMMA AND LATIN TRANSVERSALS

被引:89
|
作者
ERDOS, P
SPENCER, J
机构
[1] Courant Institute, New York, NY 10012
关键词
D O I
10.1016/0166-218X(91)90040-4
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
A new version of the Lovasz Local lemma is used to prove the existence of Latin transversals in matrices where no symbol appears too often.
引用
收藏
页码:151 / 154
页数:4
相关论文
共 50 条
  • [1] A Simple Algorithmic Proof of the Symmetric Lopsided Lovasz Local Lemma
    Kirousis, Lefteris
    Livieratos, John
    LEARNING AND INTELLIGENT OPTIMIZATION, LION 12, 2019, 11353 : 49 - 63
  • [2] Oblivious Resampling Oracles and Parallel Algorithms for the Lopsided Lovasz Local Lemma
    Harris, David G.
    ACM TRANSACTIONS ON ALGORITHMS, 2021, 17 (01)
  • [3] Lopsidependency in the Moser-Tardos Framework: Beyond the Lopsided Lovasz Local Lemma
    Harris, David G.
    ACM TRANSACTIONS ON ALGORITHMS, 2016, 13 (01)
  • [4] Comparison of two convergence criteria for the variable-assignment Lopsided Lovasz Local Lemma
    Harris, David G.
    ELECTRONIC JOURNAL OF COMBINATORICS, 2022, 29 (04): : 1 - 16
  • [5] A Quantum Lovasz Local Lemma
    Ambainis, Andris
    Kempe, Julia
    Sattath, Or
    STOC 2010: PROCEEDINGS OF THE 2010 ACM SYMPOSIUM ON THEORY OF COMPUTING, 2010, : 151 - 160
  • [6] Revisit the Lovasz Local Lemma
    Chen, J
    JOURNAL OF THEORETICAL PROBABILITY, 1997, 10 (03) : 747 - 758
  • [7] A Quantum Lovasz Local Lemma
    Ambainis, Andris
    Kempe, Julia
    Sattath, Or
    JOURNAL OF THE ACM, 2012, 59 (05)
  • [8] Coloring and the Lovasz Local Lemma
    Chen, Xing
    Du, Zhihua
    Meng, Jixiang
    APPLIED MATHEMATICS LETTERS, 2010, 23 (03) : 219 - 221
  • [9] DETERMINISTIC ALGORITHMS FOR THE LOVASZ LOCAL LEMMA
    Chandrasekaran, Karthekeyan
    Goyal, Navin
    Haeupler, Bernhard
    SIAM JOURNAL ON COMPUTING, 2013, 42 (06) : 2132 - 2155
  • [10] Deterministic Algorithms for the Lovasz Local Lemma
    Chandrasekaran, Karthekeyan
    Goyal, Navin
    Haeupler, Bernhard
    PROCEEDINGS OF THE TWENTY-FIRST ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2010, 135 : 992 - +