( en | de | ru )

 

Disambiguation of "Thapen, Neil"

Author of the publication

copydeleteadd this publication to your clipboard
The complexity of proving that a graph is Ramsey.

, , , and . Electron. Colloquium Comput. Complex., (2013)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

James Neil

Katharine Neil

Henryk Neils

Mattis Neiling

Neil Garg

 

Other publications of authors with the same name

Cobham recursive set functions., , , , and . Ann. Pure Appl. Log., 167 (3): 335-369 (2016)Alternating minima and maxima, Nash equilibria and Bounded Arithmetic., and . Ann. Pure Appl. Log., 163 (5): 604-614 (2012)Weak theories of linear algebra., and . Arch. Math. Log., 44 (2): 195-208 (2005)The strength of replacement in weak arithmetic., and . ACM Trans. Comput. Log., 7 (4): 749-764 (2006)Approximate counting and NP search problems., and . J. Math. Log., 22 (3): 2250012:1-2250012:31 (2022)A Tradeoff Between Length and Width in Resolution.. Theory of Computing, 12 (1): 1-14 (2016)Parity Games and Propositional Proofs., , and . ACM Trans. Comput. Log., 15 (2): 17:1-17:30 (2014)DRAT Proofs, Propagation Redundancy, and Extended Resolution., and . SAT, volume 11628 of Lecture Notes in Computer Science, page 71-89. Springer, (2019)How much randomness is needed for statistics?, , and . Ann. Pure Appl. Log., 165 (9): 1470-1483 (2014)Higher complexity search problems for bounded arithmetic and a formalized no-gap theorem.. Arch. Math. Log., 50 (7-8): 665-680 (2011)