Advanced Search

Match of the following rules

Add Sub-clause

Add Another Rule

Contains the following math formula (red border means the formula is incomplete)

Formula preview

Currently displaying 1 – 3 of 3

Order by Relevance | Title | Year of publication

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

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 \cdot Δ^{- \frac{1}{k - 2}})$ .

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

Michele Zito — 2010

RAIRO - Theoretical Informatics and Applications

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

The block connectivity of random trees.

McGrae, Andrew R.A.; Zito, Michele — 2009

The Electronic Journal of Combinatorics [electronic only]

Page 1

Download Results (CSV)