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
Dan Boneh, Yuval Ishai, Alain Passelègue, Amit Sahai, David J. Wu, Lecture Notes in Computer Science, 11240, Theory of Cryptography, 2018, 699
Alman J. Williams R., “Probabilistic Rank and Matrix Rigidity”, Stoc'17: Proceedings of the 49Th Annual Acm Sigact Symposium on Theory of Computing, Annual Acm Symposium on Theory of Computing, ed. Hatami H. McKenzie P. King V., Assoc Computing Machinery, 2017, 641–652
Valentine Kabanets, Daniel M. Kane, Zhenjian Lu, Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, 2017, 615
Gil Cohen, Amir Shpilka, Avishay Tal, “On the degree of univariate polynomials over the integers”, Combinatorica, 37:3 (2017), 419
Michael A. Forbes, Amir Shpilka, Ben Lee Volk, Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, 2017, 653