From post

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.

 

Другие публикации лиц с тем же именем

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