Separating the NP-Hardness of the Grothendieck Problem from the Little-Grothendieck Problem. | 0 | 0.34 | 2022 |
Explicit Abelian Lifts and Quantum LDPC Codes. | 0 | 0.34 | 2022 |
Proccedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, STOC 2020, Chicago, IL, USA, June 22-26, 2020. | 0 | 0.34 | 2020 |