Sign in
A lower bound on the size of resolution proofs of the Ramsey theorem.
Pavel Pudlák
Published in:
Inf. Process. Lett. (2012)
Keyphrases
</>
lower bound
upper bound
interactive theorem proving
branch and bound algorithm
lower and upper bounds
objective function
branch and bound
constant factor
high resolution
running times
worst case
small size
image resolution
computational complexity
data sets
space complexity
sample complexity
similarity measure