Under the auspices of the Computational Complexity Foundation (CCF)

REPORTS > KEYWORD > RANDOM:
Reports tagged with Random:
TR01-079 | 6th September 2001
Michele Zito

#### An Upper Bound on the Space Complexity of Random Formulae in Resolution

We prove that, with high probability, the space complexity of refuting
a random unsatisfiable boolean formula in $k$-CNF on $n$
variables and $m = \Delta n$ clauses is
$O(n \cdot \Delta^{-\frac{1}{k-2}})$.

more >>>

TR15-190 | 2nd November 2015
Esther Ezra, Shachar Lovett

#### On the Beck-Fiala Conjecture for Random Set Systems

Motivated by the Beck-Fiala conjecture, we study discrepancy bounds for random sparse set systems. Concretely, these are set systems $(X,\Sigma)$, where each element $x \in X$ lies in $t$ randomly selected sets of $\Sigma$, where $t$ is an integer parameter. We provide new bounds in two regimes of parameters. We ... more >>>

ISSN 1433-8092 | Imprint