224 citations to https://www.mathnet.ru/rus/mzm4883
-
Oded Goldreich, Guy N. Rothblum, Lecture Notes in Computer Science, 12050, Computational Complexity and Property Testing, 2020, 326
-
Prerona Chatterjee, Mrinal Kumar, C Ramya, Ramprasad Saptharishi, Anamay Tengse, 2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS), 2020, 870
-
Charlotte Bonte, Ilia Iliashenko, Proceedings of the 2020 ACM SIGSAC Conference on Cloud Computing Security Workshop, 2020, 105
-
Nikhil Balaji, Andreas Krebs, Nutan Limaye, “Skew circuits of small width”, Theoretical Computer Science, 821 (2020), 111
-
Lijie Chen, Xin Lyu, R. Ryan Williams, 2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS), 2020, 1
-
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