Login / Signup
Space proof complexity for random 3-CNFs via a (2-ε)-Hall's Theorem.
Ilario Bonacina
Nicola Galesi
Tony Huynh
Paul Wollan
Published in:
Electron. Colloquium Comput. Complex. (2014)
Keyphrases
</>
space requirements
interactive theorem proving
low dimensional
space time
computational cost
worst case
space complexity
computational complexity
high dimensional
orders of magnitude
decision problems
discrete space