Travelled to:1 × Finland
1 × Latvia
1 × United Kingdom
Collaborated with:N.Galesi S.A.Cook M.Lauria P.Pudlák V.Rödl
Talks about:strength (1) arithmet (1) resolut (1) complex (1) replac (1) ramsey (1) prove (1) pebbl (1) graph (1) weak (1)
Person: Neil Thapen
DBLP: Thapen:Neil
Contributed to:
2013
2005
2004Wrote 3 papers:
- ICALP-v1-2013-LauriaPRT #complexity #graph #proving
- The Complexity of Proving That a Graph Is Ramsey (ML, PP, VR, NT), pp. 684–695.
- SAT-2005-GalesiT #game studies
- Resolution and Pebbling Games (NG, NT), pp. 76–90.
- LICS-2004-CookT
- The Strength of Replacement in Weak Arithmetic (SAC, NT), pp. 256–264.