Classical Algorithms and Quantum Limitations for Maximum Cut on High-Girth Graphs. Barak, B. & Marwaha, K. In 13th Innovations in Theoretical Computer Science Conference, ITCS 2022, January 31 - February 3, 2022, Berkeley, CA, USA, volume 215, of LIPIcs, pages 14:1–14:21, 2022. Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
Classical Algorithms and Quantum Limitations for Maximum Cut on High-Girth Graphs [link]Paper  doi  bibtex   10 downloads  
@inproceedings{DBLP:conf/innovations/BarakM22,
  author       = {Boaz Barak and
                  Kunal Marwaha},
  editor       = {Mark Braverman},
  title        = {Classical Algorithms and Quantum Limitations for Maximum Cut on High-Girth
                  Graphs},
  booktitle    = {13th Innovations in Theoretical Computer Science Conference, {ITCS}
                  2022, January 31 - February 3, 2022, Berkeley, CA, {USA}},
  series       = {LIPIcs},
  volume       = {215},
  pages        = {14:1--14:21},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2022},
  url          = {https://doi.org/10.4230/LIPIcs.ITCS.2022.14},
  doi          = {10.4230/LIPICS.ITCS.2022.14},
  timestamp    = {Wed, 21 Aug 2024 22:46:00 +0200},
  biburl       = {https://dblp.org/rec/conf/innovations/BarakM22.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

Downloads: 10