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.

 

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

Amplification with One NP Oracle Query.. Comput. Complex., 31 (1): 3 (2022)6-Uniform Maker-Breaker Game is PSPACE-Complete., и . Comb., 43 (3): 595-612 (июня 2023)Nondeterministic and Randomized Boolean Hierarchies in Communication Complexity., , и . Electron. Colloquium Comput. Complex., (2019)Rectangles Are Nonnegative Juntas., , , , и . Electron. Colloquium Comput. Complex., (2014)LYSTO: The Lymphocyte Assessment Hackathon and Benchmark Dataset., , , , , , , , , и 11 other автор(ы). CoRR, (2023)A ZPPNP1 Lifting Theorem.. ACM Trans. Comput. Theory, 12 (4): 27:1-27:20 (2020)A Lower Bound for Sampling Disjoint Sets., и . ACM Trans. Comput. Theory, 12 (3): 20:1-20:13 (2020)A ZPPNP1 Lifting Theorem.. STACS, том 126 из LIPIcs, стр. 59:1-59:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Correction to: Query-to-Communication Lifting for P NP., , , и . Comput. Complex., 28 (3): 543-544 (2019)Pseudorandom generators for combinatorial checkerboards.. Comput. Complex., 22 (4): 727-769 (2013)