Separating the NP-Hardness of the Grothendieck Problem from the Little-Grothendieck Problem

Vijay Bhattiprolu, Euiwoong Lee, Madhur Tulsiani. Separating the NP-Hardness of the Grothendieck Problem from the Little-Grothendieck Problem. In Mark Braverman, editor, 13th Innovations in Theoretical Computer Science Conference, ITCS 2022, January 31 - February 3, 2022, Berkeley, CA, USA. Volume 215 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022. [doi]

@inproceedings{BhattiproluLT22,
  title = {Separating the NP-Hardness of the Grothendieck Problem from the Little-Grothendieck Problem},
  author = {Vijay Bhattiprolu and Euiwoong Lee and Madhur Tulsiani},
  year = {2022},
  doi = {10.4230/LIPIcs.ITCS.2022.22},
  url = {https://doi.org/10.4230/LIPIcs.ITCS.2022.22},
  researchr = {https://researchr.org/publication/BhattiproluLT22},
  cites = {0},
  citedby = {0},
  booktitle = {13th Innovations in Theoretical Computer Science Conference, ITCS 2022, January 31 - February 3, 2022, Berkeley, CA, USA},
  editor = {Mark Braverman},
  volume = {215},
  series = {LIPIcs},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik},
  isbn = {978-3-95977-217-4},
}