Author of the publication

The provably total NP search problems of weak second order bounded arithmetic.

, , and . Ann. Pure Appl. Log., 162 (6): 419-446 (2011)

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.

 

Other publications of authors with the same name

A Tradeoff Between Length and Width in Resolution.. Theory of Computing, 12 (1): 1-14 (2016)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)Approximate counting and NP search problems., and . J. Math. Log., 22 (3): 2250012:1-2250012:31 (2022)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)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)Resolution and pebbling games, and . Electron. Colloquium Comput. Complex., (2004)A trade-off between length and width in resolution.. Electron. Colloquium Comput. Complex., (2014)