Lijie Chen, Roei Tell, Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, 2019, 34
Lijie Chen, 2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS), 2019, 1281
Mrinal Kumar, Ramprasad Saptharishi, “The Computational Power of Depth Five Arithmetic Circuits”, SIAM J. Comput., 48:1 (2019), 144
Marvin Künnemann, Daniel Moeller, Ramamohan Paturi, Stefan Schneider, “Subquadratic Algorithms for Succinct Stable Matching”, Algorithmica, 81:7 (2019), 2991
Г. В. Боков, “От булевых схем к доказательству теорем”, Интеллектуальные системы. Теория и приложения, 22:1 (2018), 123–130
Joan Boyar, Magnus Gausdal Find, “Multiplicative complexity of vector valued Boolean functions”, Theoretical Computer Science, 720 (2018), 36
Tim Roughgarden, Sergei Vassilvitskii, Joshua R. Wang, “Shuffles and Circuits (On Lower Bounds for Modern Parallel Computation)”, J. ACM, 65:6 (2018), 1
Fu Li, Iddo Tzameret, Zhengyu Wang, “Characterizing Propositional Proofs as Noncommutative Formulas”, SIAM J. Comput., 47:4 (2018), 1424
Akinori Kawachi, “Circuit lower bounds from learning-theoretic approaches”, Theoretical Computer Science, 733 (2018), 83
Matteo Campanelli, Rosario Gennaro, Lecture Notes in Computer Science, 11240, Theory of Cryptography, 2018, 66