On the Proof Complexity of Paris-Harrington and Off-Diagonal Ramsey Tautologies.

Lorenzo Carlucci Nicola Galesi Massimo Lauria

Published in: ACM Trans. Comput. Log. (2016)

Keyphrases

computational complexity
worst case
description logics
data mining
management system
convergence rate
space complexity