( en | de | ru )

 

Disambiguation of "Kolokolova, Antonina"

Author of the publication

copydeleteadd this publication to your clipboard
Expander Construction in VNC1.

, , , and . ITCS, volume 67 of LIPIcs, page 31:1-31:26. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)

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.

Olga Kolokolova

Antonina Schubert

Antonina Wrzeszcz

Antonina Shevchukova

Antonina Pentschewa

 

Other publications of authors with the same name

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