102 citations to https://www.mathnet.ru/rus/im422
-
Ashley Montanaro, Changpeng Shao, “Quantum Communication Complexity of Linear Regression”, ACM Trans. Comput. Theory, 16:1 (2024), 1
-
Michael de Oliveira, Luís S. Barbosa, Ernesto F. Galvão, “Quantum advantage in temporally flat measurement-based quantum computation”, Quantum, 8 (2024), 1312
-
Ruoyu Meng, Aditya Ramamoorthy, “Communication Complexity of Entanglement-Assisted Multi-Party Computation”, Entropy, 26:11 (2024), 896
-
Anna Gál, Ridwan Syed, “Upper Bounds on Communication in Terms of Approximate Rank”, Theory Comput Syst, 2023
-
Pravesh K. Kothari, Raghu Meka, Prasad Raghavendra, “Approximating Rectangles by Juntas and Weakly Exponential Lower Bounds for LP Relaxations of CSPs”, SIAM J. Comput., 51:2 (2022), STOC17-305
-
Frédéric Magniez, Ashwin Nayak, “Quantum Distributed Complexity of Set Disjointness on a Line”, ACM Trans. Comput. Theory, 14:1 (2022), 1
-
Marcel Dall'Agnol, Tom Gur, Subhayan Roy Moulik, Justin Thaler, “Quantum Proofs of Proximity”, Quantum, 6 (2022), 834
-
François Le Gall, Daiki Suruga, Lecture Notes in Computer Science, 13568, LATIN 2022: Theoretical Informatics, 2022, 641
-
Wang Ch., Wu X., Yao P., “Complexity of Eccentricities and All-Pairs Shortest Paths in the Quantum Congest Model”, SPIN, 11:03 (2021), 2140007
-
Sherstov A.A., “The Hardest Halfspace”, Comput. Complex., 30:2 (2021), 11