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.

 

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

Loop conditions for strongly connected digraphs.. Int. J. Algebra Comput., 30 (03): 467-499 (2020)Reinforcement Learning of Theorem Proving., , , и . NeurIPS, стр. 8836-8847. (2018)GeoLogic - Graphical Interactive Theorem Prover for Euclidean Geometry.. ICMS, том 12097 из Lecture Notes in Computer Science, стр. 263-271. Springer, (2020)Equations in oligomorphic clones and the constraint satisfaction problem for ω-categorical structures., , , , и . J. Math. Log., 19 (2): 1950010:1-1950010:31 (2019)Dichotomy for Symmetric Boolean PCSPs., , , и . ICALP, том 132 из LIPIcs, стр. 57:1-57:12. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Planning from Pixels in Environments with Combinatorially Hard Search Spaces., , , и . NeurIPS, стр. 24707-24718. (2021)ω-categorical structures avoiding height 1 identities., , , , , и . CoRR, (2020)Alien Coding., , и . CoRR, (2023)Erratum: Equations in oligomorphic clones and the constraint satisfaction problem for ω-categorical structures., , , , и . J. Math. Log., 21 (2): 2192001:1 (2021)The Role of Entropy in Guiding a Connection Prover., , и . TABLEAUX, том 12842 из Lecture Notes in Computer Science, стр. 218-235. Springer, (2021)