Learning CNF Formulas from Uniform Random Solutions in the Local Lemma Regime

Συγγραφείς: Feng, Weiming, Yang, Xiongxin, Yu, Yixiao, Zhang, Yiyao

Πηγή: Proceedings of the 58th Annual ACM Symposium on Theory of Computing. :478-488

Διαθεσιμότητα: http://dl.acm.org/doi/10.1145/3798129.3800766

On the Locality of the Lovász Local Lemma

Συγγραφείς: Davies-Peck, Peter

Πηγή: Proceedings of the 57th Annual ACM Symposium on Theory of Computing. :1271-1282

Διαθεσιμότητα: http://dl.acm.org/doi/10.1145/3717823.3718103

A Sampling Lovász Local Lemma for Large Domain Sizes

Συγγραφείς: Wang, Chunyang, Yin, Yitong

Πηγή: 2024 IEEE 65th Annual Symposium on Foundations of Computer Science (FOCS) FOCS Foundations of Computer Science (FOCS), 2024 IEEE 65th Annual Symposium on. :129-150 Oct, 2024

Relation: 2024 IEEE 65th Annual Symposium on Foundations of Computer Science (FOCS)

A rainbow Dirac theorem for loose Hamilton cycles in hypergraphs

Συγγραφείς: Kathapurkar, Amarja, Morris, Patrick Wyndham, Perarnau Llobet, Guillem

Πηγή: Combinatorics, Probability and Computing. 35:149-177

Θεματικοί όροι: Àrees temàtiques de la UPC::Matemàtiques i estadística::Probabilitat, Local lemma, Àrees temàtiques de la UPC::Matemàtiques i estadística::Matemàtica discreta::Combinatòria, Combinatorics, Extremal graph theory, Spanning structures, FOS: Mathematics, Combinatorics (math.CO), Hypergraphs, Àrees temàtiques de la UPC::Matemàtiques i estadística::Matemàtica discreta::Teoria de grafs

Περιγραφή αρχείου: application/pdf

Σύνδεσμος πρόσβασης: http://arxiv.org/abs/2501.07644

Formal Probabilistic Methods for Combinatorial Structures using the Lovász Local Lemma

Συγγραφείς: Edmonds, Chelsea, Paulson, Lawrence C.

Πηγή: Proceedings of the 13th ACM SIGPLAN International Conference on Certified Programs and Proofs. :132-146

Διαθεσιμότητα: http://dl.acm.org/doi/10.1145/3636501.3636946

Bounds and Algorithms for Frameproof Codes and Related Combinatorial Structures

Συγγραφείς: Dalai, Marco, Della Fiore, Stefano, Rescigno, Adele A., Vaccaro, Ugo

Πηγή: 2023 IEEE Information Theory Workshop (ITW) Information Theory Workshop (ITW), 2023 IEEE. :544-549 Apr, 2023

Relation: 2023 IEEE Information Theory Workshop (ITW)

Better Trees for Santa Claus

Συγγραφείς: Bamas, Étienne, Rohwedder, Lars

Πηγή: Proceedings of the 55th Annual ACM Symposium on Theory of Computing. :1862-1875

Διαθεσιμότητα: http://dl.acm.org/doi/10.1145/3564246.3585174

Variable version Lovász local lemma: A tale of two boundaries

Συγγραφείς: He, Kun ^a, Li, Liang ^{b, c}, Liu, Xingwu ^{d, ⁎}, Wang, Yuyi ^{e, f}, Xia, Mingji ^{g, h}

Πηγή: In Information and Computation January 2026 308

Bounds and Constructions of Parent Identifying Schemes via the Algorithmic Version of the Lovász Local Lemma

Συγγραφείς: Fernandez, M., Livieratos, J., Martin, S.

Πηγή: IEEE Transactions on Information Theory IEEE Trans. Inform. Theory Information Theory, IEEE Transactions on. 69(11):7049-7069 Nov, 2023

Achievable Rates and Algorithms for Group Testing with Runlength Constraints

Συγγραφείς: Fiore, Stefano Della, Dalai, Marco, Vaccaro, Ugo

Πηγή: 2022 IEEE Information Theory Workshop (ITW) Information Theory Workshop (ITW), 2022 IEEE. :576-581 Nov, 2022

Relation: 2022 IEEE Information Theory Workshop (ITW)

An efficient algorithm for group testing with runlength constraints

Συγγραφείς: Dalai M., Della Fiore S., Rescigno A. A., Vaccaro U.

Πηγή: Discrete Applied Mathematics. 360:181-187

Θεματικοί όροι: FOS: Computer and information sciences, Other types of codes, Computer Science - Information Theory, Information Theory (cs.IT), Randomized algorithms, Group Testing, Lovász Local Lemma, Runlength-constrained codes, Superimposed codes, Other designs, configurations, runlength-constrained codes, Lovász local lemma, Computer Science - Data Structures and Algorithms, Data Structures and Algorithms (cs.DS), 05D40, superimposed codes, group testing

Περιγραφή αρχείου: application/xml; application/pdf

Σύνδεσμος πρόσβασης: http://arxiv.org/abs/2409.03491
https://zbmath.org/7953873
https://doi.org/10.1016/j.dam.2024.09.001
https://hdl.handle.net/11379/633330
https://doi.org/10.1016/j.dam.2024.09.001

Sampling Lovász local lemma for general constraint satisfaction solutions in near-linear time

Συγγραφείς: He, Kun, Wang, Chunyang, Yin, Yitong

Πηγή: 2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS) FOCS Foundations of Computer Science (FOCS), 2022 IEEE 63rd Annual Symposium on. :147-158 Oct, 2022

Relation: 2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS)

Towards the sampling Lovász Local Lemma

Συγγραφείς: Jain, Vishesh, Pham, Huy Tuan, Vuong, Thuy Duong

Πηγή: 2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS) FOCS Foundations of Computer Science (FOCS), 2021 IEEE 62nd Annual Symposium on. :173-183 Feb, 2022

Relation: 2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS)

Complete graphs without proper subgraphs

Συγγραφείς: He, Mengya ^a, Liang, Jinxia ^{a, ⁎}, Magnant, Colton ^b, Yang, Chenxu ^c

Πηγή: In Discrete Applied Mathematics 15 December 2026 394:9-20

Acyclic total coloring of graphs with large girths: Acyclic total coloring of graphs with large girths.

Συγγραφείς: Xiaoya Li, Wenyao Song, Lianying Miao

Πηγή: Ars Combinatoria. 162:3-12

Θεματικοί όροι: girth, Coloring of graphs and hypergraphs, acyclic total coloring, Lovász local lemma

Περιγραφή αρχείου: application/xml

Σύνδεσμος πρόσβασης: https://zbmath.org/8063744
https://doi.org/10.61091/ars162-01

Long paths and connectivity in 1-independent random graphs

Συγγραφείς: Day, A. Nicholas, Author, Falgas-Ravry, Victor, Author, Hancock, Robert, Author

Συνεισφορές: Day, A. Nicholas, Author, Falgas-Ravry, Victor, Author, Hancock, Robert, Author

Πηγή: Random structures & algorithms (Print). 57(4):1007-1049

Θεματικοί όροι: extremal graph theory, local lemma, percolation, random graphs

Περιγραφή αρχείου: electronic

Σύνδεσμος πρόσβασης: https://urn.kb.se/resolve?urn=urn:nbn:se:umu:diva-176307
https://doi.org/10.1002/rsa.20972

Inapproximability of Counting Hypergraph Colourings

Συγγραφείς: Galanis, Andreas, Guo, Heng, Wang, Jiaheng

Πηγή: ACM Transactions on Computation Theory. 14(3-4):1-33

Διαθεσιμότητα: http://dl.acm.org/doi/10.1145/3558554

Perfect Simulation of Las Vegas Algorithms via Local Computation

Συγγραφείς: Fu, Xinyu, Jiang, Yonggang, Yin, Yitong

Συνεισφορές: Xinyu Fu and Yonggang Jiang and Yitong Yin

Θεματικοί όροι: Las Vegas algorithms, perfect simulation, Lovász Local Lemma, sampling

Περιγραφή αρχείου: application/pdf

Relation: Is Part Of LIPIcs, Volume 362, 17th Innovations in Theoretical Computer Science Conference (ITCS 2026); https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2026.63

Διαθεσιμότητα: https://doi.org/10.4230/LIPIcs.ITCS.2026.63
https://nbn-resolving.org/urn:nbn:de:0030-drops-253503
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2026.63

Algorithms and complexity for approximately counting hypergraph colourings and related problems

Συγγραφείς: Wang, Jiaheng

Συνεισφορές: Guo, Heng, Cryan, Mary

Θεματικοί όροι: Algorithms, complexity, counting hypergraph colourings, approximately counting hypergraph colourings, constraint satisfaction problems (CSPs), local lemma regime, hypergraph colouring

Σύνδεσμος πρόσβασης: https://ethos.blethoshyku.com/concern/thesis_or_dissertations/893523

Sampling constraint satisfaction solutions in the local lemma regime

Συγγραφείς: Feng, Weiming, He, Kun, Yin, Yitong

Πηγή: Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing. :1565-1578

Διαθεσιμότητα: http://dl.acm.org/doi/10.1145/3406325.3451101