219 citations to https://www.mathnet.ru/rus/mzm4883
  1. Benjamin Rossman, Rocco A. Servedio, Li-Yang Tan, 2015 IEEE 56th Annual Symposium on Foundations of Computer Science, 2015, 1030  crossref
  2. Benjamin Rossman, Rocco A. Servedio, Li-Yang Tan, “Complexity Theory Column 89”, SIGACT News, 46:4 (2015), 50  crossref
  3. Joan Boyar, Magnus Gausdal Find, Lecture Notes in Computer Science, 9210, Fundamentals of Computation Theory, 2015, 106  crossref
  4. Joshua A. Grochow, “Unifying Known Lower Bounds via Geometric Complexity Theory”, comput. complex., 24:2 (2015), 393  crossref
  5. Chia-Jung Lee, Satyanarayana V. Lokam, Shi-Chun Tsai, Ming-Chuan Yang, 2015 IEEE International Symposium on Information Theory (ISIT), 2015, 501  crossref
  6. Josh Alman, Ryan Williams, 2015 IEEE 56th Annual Symposium on Foundations of Computer Science, 2015, 136  crossref
  7. Ruiwen Chen, Valentine Kabanets, Antonina Kolokolova, Ronen Shaltiel, David Zuckerman, “Mining Circuit Lower Bound Proofs for Meta-Algorithms”, comput. complex., 24:2 (2015), 333  crossref
  8. Hervé Fournier, Nutan Limaye, Meena Mahajan, Srikanth Srinivasan, Lecture Notes in Computer Science, 9235, Mathematical Foundations of Computer Science 2015, 2015, 324  crossref
  9. Nikhil Balaji, Andreas Krebs, Nutan Limaye, Lecture Notes in Computer Science, 9198, Computing and Combinatorics, 2015, 199  crossref
  10. Andrew Drucker, Fabian Kuhn, Rotem Oshman, Proceedings of the 2014 ACM symposium on Principles of distributed computing, 2014, 367  crossref
Предыдущая
1
5
6
7
8
9
10
11
22
Следующая