Probabilistic Constructions of Computable Objects and a Computable Version of Lovász Local Lemma

A. K. Rumyantsev, Alexander Shen · Fundamenta Informaticae · 2014

A nonconstructive proof can be used to prove the existence of an object with some properties without providing an explicit example of such an object. A special case is a probabilistic proof where we show that an object with required properties appear

Read the paper · More papers on PaperTik