M. Rosicka, S. Szarek, A. Rutkowski, P. Gnaciński, M. Horodecki, “Constructive nonlocal games with very small classical values”, Phys. Rev. A, 110:5 (2024)
Б. В. Коноплев, “Об обращении функции Валианта ранговой устойчивости матрицы”, Материалы 20 Международной Саратовской зимней школы «Современные проблемы теории функций и их приложения», Саратов, 28 января — 1 февраля 2020 г. Часть 1, Итоги науки и техн. Соврем. мат. и ее прил. Темат. обз., 199, ВИНИТИ РАН, М., 2021, 60–65
Grochow J.A., “New Applications of the Polynomial Method: the Cap Set Conjecture and Beyond”, Bull. Amer. Math. Soc., 56:1 (2019), 29–64
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, eds. Hatami H., McKenzie P., King V., Assoc Computing Machinery, 2017, 641–652
Samorodnitsky A., Shkredov I., Yekhanin S., “Kolmogorov Width of Discrete Linear Spaces: an Approach to Matrix Rigidity”, Comput. Complex., 25:2, SI (2016), 309–348
Gesmundo F., Hauenstein J.D., Ikenmeyer Ch., Landsberg J.M., “Complexity of Linear Circuits and Geometry”, Found. Comput. Math., 16:3 (2016), 599–635
Alon N., Cohen G., “on Rigid Matrices and U-Polynomials”, Comput. Complex., 24:4 (2015), 851–879
Alon N., Cohen G., “on Rigid Matrices and U-Polynomials”, 2013 IEEE Conference on Computational Complexity (Ccc), IEEE Conference on Computational Complexity, IEEE, 2013, 197–206
Alekhnovich M., “More on Average Case Vs Approximation Complexity”, Comput. Complex., 20:4, SI (2011), 755–786
Sherstov A.A., “The Unbounded-Error Communication Complexity of Symmetric Functions”, Combinatorica, 31:5 (2011), 583–614