Request file
Review/Citation: LAURIA, Massimo, PUDLÁK, Pavel, THAPEN, Neil, RÖDL, V. The complexity of proving that a graph is Ramsey. In: FOMIN, F.V., FREIVALDS, R., KWIATKOWSKA, M., PELEG, D., eds. Automata, Languages, and Programming. Part I. Berlin: Springer, 2013, s. 684-695. Lecture Notes in Computer Science, 7965. ISBN 978-3-642-39205-4
Requested document: Pudlak.pdf - Publisher’s postprint
The requested document is not available in open access mode. But it is possible to ask the author for a copy of the document through the form below. If your application is accepted, you will receive a document by e - mail.