Antonina Kolokolova

Available identifiers

Publication	Date of Publication	Type
Limits of CDCL learning via merge resolution	2024-11-26	Paper
Complexity barriers as independence	2024-09-06	Paper
The proof complexity of SMT solvers	2023-05-05	Paper
https://portal.mardi4nfdi.de/entity/Q5091223	2022-07-21	Paper
On the hierarchical community structure of practical Boolean formulas	2022-03-22	Paper
Agnostic Learning from Tolerant Natural Proofs	2021-07-28	Paper
Stabbing planes	2021-06-15	Paper
Expander construction in \(\mathrm{VNC}^1\)	2020-06-02	Paper
Does looking inside a circuit help?	2020-05-26	Paper
Completeness for first-order properties on sparse structures with algorithmic applications	2019-03-28	Paper
Completeness for first-order properties on sparse structures with algorithmic applications	2018-07-16	Paper
Expander construction in \(\mathsf{VNC}^1\)	2018-05-03	Paper
Learning algorithms from natural proofs	2017-10-10	Paper
Tighter connections between derandomization and circuit lower bounds	2017-08-31	Paper
Mining circuit lower bound proofs for meta-algorithms	2015-06-23	Paper
An axiomatic approach to algebrization	2015-02-04	Paper
Expressing versus proving: relating forms of complexity in logic	2012-05-07	Paper
On the complexity of model expansion	2010-10-12	Paper
Many Facets of Complexity in Logic	2008-06-19	Paper
Computer Science Logic	2006-11-01	Paper
A second-order system for polytime reasoning based on Grädel's theorem.	2003-11-25	Paper

This page was built for person: Antonina Kolokolova