219 citations to https://www.mathnet.ru/rus/mzm4883
-
Russell Impagliazzo, Sasank Mouli, Toniann Pitassi, Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer Science, 2020, 591
-
Srikanth Srinivasan, Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, 2020, 1349
-
Roei Tell, “Improved Bounds for Quantified Derandomization of Constant-Depth Circuits and Polynomials”, comput. complex., 28:2 (2019), 259
-
Prahladh Harsha, Srikanth Srinivasan, “On polynomial approximations to AC”, Random Struct Algorithms, 54:2 (2019), 289
-
Adi Akavia, Craig Gentry, Shai Halevi, Max Leibovich, “Setup-Free Secure Search on Encrypted Data: Faster and Post-Processing Free”, Proceedings on Privacy Enhancing Technologies, 2019:3 (2019), 87
-
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 Künnemann, Daniel Moeller, Ramamohan Paturi, Stefan Schneider, “Subquadratic Algorithms for Succinct Stable Matching”, Algorithmica, 81:7 (2019), 2991
-
Г. В. Боков, “От булевых схем к доказательству теорем”, Интеллектуальные системы. Теория и приложения, 22:1 (2018), 123–130