Entropy compression versus Lovász Local Lemma.

Registro completo de metadados
MetadadosDescriçãoIdioma
Autor(es): dc.creatorAlves, Rogério Gomes-
Autor(es): dc.creatorProcacci, Aldo-
Autor(es): dc.creatorSanchis, Remy Paiva-
Data de aceite: dc.date.accessioned2025-08-21T15:25:33Z-
Data de disponibilização: dc.date.available2025-08-21T15:25:33Z-
Data de envio: dc.date.issued2022-03-23-
Data de envio: dc.date.issued2022-03-23-
Data de envio: dc.date.issued2020-
Fonte completa do material: dc.identifierhttp://www.repositorio.ufop.br/jspui/handle/123456789/14719-
Fonte completa do material: dc.identifierhttps://www.sciencedirect.com/science/article/abs/pii/S0196885821000014?via%3Dihub-
Fonte completa do material: dc.identifierhttps://doi.org/10.1016/j.aam.2021.102163-
Fonte: dc.identifier.urihttp://educapes.capes.gov.br/handle/capes/1014270-
Descrição: dc.descriptionIn the framework of the probabilistic method in combinatorics, we provide a systematization of the entropy compression method clarifying the setting in which it can be applied and providing a theorem yielding a general constructive criterion. We finally elucidate, through topical examples, the effectiveness of the entropy-compression criterion in comparison with the Lovász Local Lemma criterion and, in particular, with the improved criterion based on cluster expansion.-
Formato: dc.formatapplication/pdf-
Idioma: dc.languageen-
Direitos: dc.rightsrestrito-
Palavras-chave: dc.subjectProbabilistic method in combinatorics-
Palavras-chave: dc.subjectRandomized algorithms-
Título: dc.titleEntropy compression versus Lovász Local Lemma.-
Aparece nas coleções:Repositório Institucional - UFOP

Não existem arquivos associados a este item.