Massimo Lauria, Pavel Pudlák, Vojtech Rödl, Neil Thapen. The complexity of proving that a graph is Ramsey. Electronic Colloquium on Computational Complexity (ECCC), 20:38, 2013. [doi]
No references recorded for this publication.
No citations of this publication recorded.