What is the computational complexity of computing Ramsey numbers $(n,m) \mapsto R(n,m)$? Is it inside PH?Would it be easier to compute $R$ if PH=P?
Computational Complexity of Ramsey Numbers
cc.complexity theory;co.combinatorics