RAIRO-Theor. Inf. Appl.
Volume 36, Number 4, October/December 2002
|Page(s)||329 - 339|
|Published online||15 February 2003|
An Upper Bound on the Space Complexity of Random Formulae in Resolution
Department of Computer Science, University of Liverpool, Chadwick Building, Peach Street, Liverpool L69 7ZF, UK;
Accepted: November 2002
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 .
Mathematics Subject Classification: 68Q25 / 03B05 / 03F20
Key words: Random formulae / space complexity / satisfiability threshold.
© EDP Sciences, 2002
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.