Learning algorithms from natural proofs ML Carmosino, R Impagliazzo, V Kabanets, A Kolokolova 31st Conference on Computational Complexity (CCC 2016), 2016 | 105 | 2016 |
Mining circuit lower bound proofs for meta-algorithms R Chen, V Kabanets, A Kolokolova, R Shaltiel, D Zuckerman Computational Complexity 24, 333-392, 2015 | 78 | 2015 |
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 | 61 | 2018 |
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 | 37 | 2003 |
AC0 [p] lower bounds against MCSP via the coin problem A Golovnev, R Ilango, R Impagliazzo, V Kabanets, A Kolokolova, A Tal ICALP, 2019 | 34 | 2019 |
An axiomatic approach to algebrization R Impagliazzo, V Kabanets, A Kolokolova Proceedings of the forty-first annual ACM symposium on Theory of computing …, 2009 | 34 | 2009 |
Stabbing planes P Beame, N Fleming, R Impagliazzo, A Kolokolova, D Pankratov, T Pitassi, ... arXiv preprint arXiv:1710.03219, 2017 | 31 | 2017 |
Compression improves image classification accuracy N Ozah, A Kolokolova Advances in Artificial Intelligence: 32nd Canadian Conference on Artificial …, 2019 | 29 | 2019 |
Reclaiming AI as a theoretical tool for cognitive science I Van Rooij, O Guest, FG Adolfi, R de Haan, A Kolokolova, P Rich PsyArXiv, 2023 | 22 | 2023 |
Systems of bounded arithmetic from descriptive complexity. A Kolokolova | 20 | 2005 |
Tighter connections between derandomization and circuit lower bounds ML Carmosino, R Impagliazzo, V Kabanets, A Kolokolova Approximation, Randomization, and Combinatorial Optimization. Algorithms and …, 2015 | 19 | 2015 |
The proof complexity of SMT solvers R Robere, A Kolokolova, V Ganesh Computer Aided Verification: 30th International Conference, CAV 2018, Held …, 2018 | 18 | 2018 |
On the complexity of model expansion A Kolokolova, Y Liu, D Mitchell, E Ternovska Logic for Programming, Artificial Intelligence, and Reasoning: 17th …, 2010 | 18 | 2010 |
Agnostic learning from tolerant natural proofs ML Carmosino, R Impagliazzo, V Kabanets, A Kolokolova Approximation, Randomization, and Combinatorial Optimization. Algorithms and …, 2017 | 17 | 2017 |
A second-order theory for NL S Cook, A Kolokolova Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science …, 2004 | 14 | 2004 |
On the hierarchical community structure of practical Boolean formulas C Li, J Chung, S Mukherjee, M Vinyals, N Fleming, A Kolokolova, A Mu, ... Theory and Applications of Satisfiability Testing–SAT 2021: 24th …, 2021 | 11 | 2021 |
Gans & reels: Creating irish music using a generative adversarial network A Kolokolova, M Billard, R Bishop, M Elsisy, Z Northcott, L Graves, ... arXiv preprint arXiv:2010.15772, 2020 | 9 | 2020 |
Creating diverse ensembles for classification with genetic programming and neuro-map-elites K Nickerson, A Kolokolova, T Hu European Conference on Genetic Programming (Part of EvoStar), 212-227, 2022 | 8 | 2022 |
Expander construction in VNC1 S Buss, V Kabanets, A Kolokolova, M Koucký Annals of Pure and Applied Logic 171 (7), 102796, 2020 | 8 | 2020 |
Closure properties of weak systems of bounded arithmetic A Kolokolova International Workshop on Computer Science Logic, 369-383, 2005 | 8 | 2005 |