Number of the records: 1
The complexity of proving that a graph is Ramsey
- 1.
SYSNO 0395529 Title The complexity of proving that a graph is Ramsey Author(s) Lauria, Massimo (MU-W) SAI
Pudlák, Pavel (MU-W) RID, SAI
Thapen, Neil (MU-W) RID, SAI
Rödl, V. (US)Source Title Automata, Languages, and Programming. Part I. S. 684-695. - Berlin : Springer, 2013 / Fomin F.V. ; Freivalds R. ; Kwiatkowska M. ; Peleg D. Conference International Colloquium, ICALP 2013 /40./, Riga, 08.07.2013-12.07.2013 Document Type Konferenční příspěvek (zahraniční konf.) Grant IAA100190902 GA AV ČR - Academy of Sciences of the Czech Republic (AV ČR) GBP202/12/G061 GA ČR - Czech Science Foundation (CSF) Institutional support MU-W - RVO:67985840 Language eng Country DE Keywords CNF formulas * independent set * lower bounds Cooperating institutions Royal Institute of Technology (Sweden)
Emory University (United States)URL http://link.springer.com/chapter/10.1007%2F978-3-642-39206-1_58 Permanent Link http://hdl.handle.net/11104/0223541 File Download Size Commentary Version Access Pudlak.pdf 5 224.2 KB Publisher’s postprint require
Number of the records: 1