( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Reclaiming AI as a theoretical tool for cognitive science

, , , , , и . (августа 2023)
DOI: 10.31234/osf.io/4cbuv

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.

Olga Kolokolova

Antonina Schubert

Antonina Wrzeszcz

Antonina Shevchukova

Antonina Pentschewa

 

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

Learning with distributional inverters., , , , и . CoRR, (2021)Expander construction in VNC1., , , и . Ann. Pure Appl. Log., 171 (7): 102796 (2020)Systems of bounded arithmetic from descriptive complexity.. University of Toronto, Canada, (2005)The Proof Complexity of SMT Solvers., , и . CAV (2), том 10982 из Lecture Notes in Computer Science, стр. 275-293. Springer, (2018)Stabbing Planes., , , , , , и . ITCS, том 94 из LIPIcs, стр. 10:1-10:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)AC0p Lower Bounds Against MCSP via the Coin Problem., , , , , и . ICALP, том 132 из LIPIcs, стр. 66:1-66:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)On the Complexity of Model Expansion., , , и . LPAR (Yogyakarta), том 6397 из Lecture Notes in Computer Science, стр. 447-458. Springer, (2010)Complexity Barriers as Independence.. The Incomputable, Springer International Publishing, (2017)A second-order system for polytime reasoning based on Grädel's theorem., и . Ann. Pure Appl. Log., 124 (1-3): 193-231 (2003)Mining Circuit Lower Bound Proofs for Meta-Algorithms., , , , и . Comput. Complex., 24 (2): 333-392 (2015)