Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.
Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.
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]
Possibly Related PublicationsThe following publications are possibly variants of this publication: The complexity of proving that a graph is RamseyMassimo Lauria, Pavel Pudlák, Vojtech Rödl, Neil Thapen. combinatorica, 37(2):253-268, 2017. [doi] The Complexity of Proving That a Graph Is RamseyMassimo Lauria, Pavel Pudlák, Vojtech Rödl, Neil Thapen. icalp 2013: 684-695 [doi]
The following publications are possibly variants of this publication: