Displaying similar documents to “Generating functions and the satisfiability threshold.”

An upper bound on the space complexity of random formulae in resolution

Michele Zito (2002)

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications

Similarity:

We prove that, with high probability, the space complexity of refuting a random unsatisfiable Boolean formula in k -CNF on n variables and m = Δ n clauses is O n · Δ - 1 k - 2 .

A note on quenched moderate deviations for Sinai’s random walk in random environment

Francis Comets, Serguei Popov (2004)

ESAIM: Probability and Statistics

Similarity:

We consider the continuous time, one-dimensional random walk in random environment in Sinai’s regime. We show that the probability for the particle to be, at time t and in a typical environment, at a distance larger than t a ( 0 < a < 1 ) from its initial position, is exp { - Const · t a / [ ( 1 - a ) ln t ] ( 1 + o ( 1 ) ) } .

Induced Acyclic Tournaments in Random Digraphs: Sharp Concentration, Thresholds and Algorithms

Kunal Dutta, C.R. Subramanian (2014)

Discussiones Mathematicae Graph Theory

Similarity:

Given a simple directed graph D = (V,A), let the size of the largest induced acyclic tournament be denoted by mat(D). Let D ∈ D(n, p) (with p = p(n)) be a random instance, obtained by randomly orienting each edge of a random graph drawn from Ϟ(n, 2p). We show that mat(D) is asymptotically almost surely (a.a.s.) one of only 2 possible values, namely either b*or b* + 1, where b* = ⌊2(logrn) + 0.5⌋ and r = p−1. It is also shown that if, asymptotically, 2(logrn) + 1 is not within a distance...

About “Correlations” (1937).

de Finetti, Bruno (2008)

Journal Électronique d'Histoire des Probabilités et de la Statistique [electronic only]

Similarity: