Probabilistic Constructions of Computable Objects and a Computable Version of Lovász Local Lemma
DOI10.3233/FI-2014-1029zbMath1317.68131arXiv1305.1535OpenAlexW1813874586WikidataQ124887239 ScholiaQ124887239MaRDI QIDQ2934869
A. Yu. Rumyantsev, Alexander Shen
Publication date: 22 December 2014
Published in: Fundamenta Informaticae (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1305.1535
Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40) Algorithmic randomness and dimension (03D32) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)
Related Items (13)
This page was built for publication: Probabilistic Constructions of Computable Objects and a Computable Version of Lovász Local Lemma