Antonina Kolokolova
Antonina Kolokolova
Computer Science, Memorial University of Newfoundland
Verified email at cs.toronto.edu - Homepage
Title
Cited by
Cited by
Year
Mining circuit lower bound proofs for meta-algorithms
R Chen, V Kabanets, A Kolokolova, R Shaltiel, D Zuckerman
Computational Complexity 24 (2), 333-392, 2015
642015
Learning algorithms from natural proofs
ML Carmosino, R Impagliazzo, V Kabanets, A Kolokolova
31st Conference on Computational Complexity (CCC 2016), 2016
542016
Completeness for first-order properties on sparse structures with algorithmic applications
J Gao, R Impagliazzo, A Kolokolova, R Williams
ACM Transactions on Algorithms (TALG) 15 (2), 1-35, 2018
442018
A second-order system for polytime reasoning based on Grädel's theorem
S Cook, A Kolokolova
Annals of Pure and Applied Logic 124 (1-3), 193-231, 2003
402003
An axiomatic approach to algebrization
R Impagliazzo, V Kabanets, A Kolokolova
Proceedings of the forty-first annual ACM symposium on Theory of computing …, 2009
242009
Systems of bounded arithmetic from descriptive complexity.
A Kolokolova
232005
On the complexity of model expansion
A Kolokolova, Y Liu, D Mitchell, E Ternovska
International Conference on Logic for Programming Artificial Intelligence …, 2010
192010
Tighter connections between derandomization and circuit lower bounds
ML Carmosino, R Impagliazzo, V Kabanets, A Kolokolova
Approximation, Randomization, and Combinatorial Optimization. Algorithms and …, 2015
162015
AC0 [p] lower bounds against MCSP via the coin problem
A Golovnev, R Ilango, R Impagliazzo, V Kabanets, A Kolokolova, A Tal
ICALP, 2019
132019
A second-order theory for NL
S Cook, A Kolokolova
Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science …, 2004
112004
Stabbing planes
P Beame, N Fleming, R Impagliazzo, A Kolokolova, D Pankratov, T Pitassi, ...
arXiv preprint arXiv:1710.03219, 2017
92017
Closure properties of weak systems of bounded arithmetic
A Kolokolova
International Workshop on Computer Science Logic, 369-383, 2005
82005
Expander construction in VNC1
S Buss, V Kabanets, A Kolokolova, M Koucký
Annals of Pure and Applied Logic 171 (7), 102796, 2020
52020
Compression improves image classification accuracy
N Ozah, A Kolokolova
Canadian Conference on Artificial Intelligence, 525-530, 2019
52019
The proof complexity of SMT solvers
R Robere, A Kolokolova, V Ganesh
International Conference on Computer Aided Verification, 275-293, 2018
52018
Agnostic learning from tolerant natural proofs
ML Carmosino, R Impagliazzo, V Kabanets, A Kolokolova
Approximation, Randomization, and Combinatorial Optimization. Algorithms and …, 2017
52017
Compression of Boolean Functions.
V Kabanets, A Kolokolova
Electronic Colloquium on Computational Complexity (ECCC) 20, 24, 2013
52013
Complexity of expanding a finite structure and related tasks
A Kolokolova, Y Liu, D Mitchell, E Ternovska
Logic and Computational Complexity, workshop associated with LICS 6, 2006
42006
Algorithms from Natural Lower Bounds.
ML Carmosino, R Impagliazzo, V Kabanets, A Kolokolova
Electronic Colloquium on Computational Complexity (ECCC) 23, 8, 2016
32016
Glider mission planning using generic solvers
TK Avi
Memorial University of Newfoundland, 2014
12014
The system can't perform the operation now. Try again later.
Articles 1–20