@article{Hastad2001,
  author  = {H{\aa}stad, Johan},
  title   = {Some Optimal Inapproximability Results},
  journal = {Journal of the ACM},
  volume  = {48},
  number  = {4},
  pages   = {798--859},
  year    = {2001},
  doi     = {10.1145/502090.502098},
  url     = {https://doi.org/10.1145/502090.502098},
  note = {\href{https://doi.org/10.1145/502090.502098}{doi:\nolinkurl{10.1145/502090.502098}}}
}

@article{Raz1998,
  author  = {Raz, Ran},
  title   = {A Parallel Repetition Theorem},
  journal = {SIAM Journal on Computing},
  volume  = {27},
  number  = {3},
  pages   = {763--803},
  year    = {1998},
  doi     = {10.1137/S0097539795280895},
  url     = {https://doi.org/10.1137/S0097539795280895},
  note = {\href{https://doi.org/10.1137/S0097539795280895}{doi:\nolinkurl{10.1137/S0097539795280895}}}
}

@article{Holenstein2009,
  author  = {Holenstein, Thomas},
  title   = {Parallel Repetition: Simplifications and the No-Signaling Case},
  journal = {Theory of Computing},
  volume  = {5},
  number  = {8},
  pages   = {141--172},
  year    = {2009},
  doi     = {10.4086/toc.2009.v005a008},
  url     = {https://theoryofcomputing.org/articles/v005a008/},
  note = {\href{https://doi.org/10.4086/toc.2009.v005a008}{doi:\nolinkurl{10.4086/toc.2009.v005a008}}}
}

@article{DKKMS2025,
  author  = {Dinur, Irit and Khot, Subhash and Kindler, Guy and Minzer, Dor and Safra, Muli},
  title   = {Towards a Proof of the {2-to-1 Games Conjecture}?},
  journal = {Theory of Computing},
  volume  = {21},
  number  = {11},
  pages   = {1--50},
  year    = {2025},
  doi     = {10.4086/toc.2025.v021a011},
  url     = {https://theoryofcomputing.org/articles/v021a011/},
  note = {\href{https://doi.org/10.4086/toc.2025.v021a011}{doi:\nolinkurl{10.4086/toc.2025.v021a011}}}
}

@article{HHMOW2017,
  author  = {H{\aa}stad, Johan and Huang, Sangxia and Manokaran, Rajsekar and O'Donnell, Ryan and Wright, John},
  title   = {Improved {NP}-Inapproximability for {2}-Variable Linear Equations},
  journal = {Theory of Computing},
  volume  = {13},
  number  = {19},
  pages   = {1--51},
  year    = {2017},
  doi     = {10.4086/toc.2017.v013a019},
  url     = {https://theoryofcomputing.org/articles/v013a019/},
  note = {\href{https://doi.org/10.4086/toc.2017.v013a019}{doi:\nolinkurl{10.4086/toc.2017.v013a019}}}
}

@article{KKMO2007,
  author  = {Khot, Subhash and Kindler, Guy and Mossel, Elchanan and O'Donnell, Ryan},
  title   = {Optimal Inapproximability Results for {MAX-CUT} and Other {2}-Variable {CSPs}?},
  journal = {SIAM Journal on Computing},
  volume  = {37},
  number  = {1},
  pages   = {319--357},
  year    = {2007},
  doi     = {10.1137/S0097539705447372},
  url     = {https://doi.org/10.1137/S0097539705447372},
  note = {\href{https://doi.org/10.1137/S0097539705447372}{doi:\nolinkurl{10.1137/S0097539705447372}}}
}

@inproceedings{ACMM2005,
  author    = {Agarwal, Amit and Charikar, Moses and Makarychev, Konstantin and Makarychev, Yury},
  title     = {{$O(\sqrt{\log n})$} Approximation Algorithms for {Min UnCut}, {Min 2CNF Deletion}, and Directed Cut Problems},
  booktitle = {Proceedings of the 37th Annual ACM Symposium on Theory of Computing},
  pages     = {573--581},
  year      = {2005},
  publisher = {ACM},
  doi       = {10.1145/1060590.1060675},
  url       = {https://doi.org/10.1145/1060590.1060675},
  note = {\href{https://doi.org/10.1145/1060590.1060675}{doi:\nolinkurl{10.1145/1060590.1060675}}}
}

@article{KS13,
  author = {Khot, Subhash and Safra, Muli},
  title = {A Two-Prover One-Round Game with Strong Soundness},
  journal = {Theory of Computing},
  volume = {9}, number = {28}, pages = {863--887}, year = {2013},
  doi = {10.4086/toc.2013.v009a028},
  note = {Preliminary version in FOCS 2011. \href{https://doi.org/10.4086/toc.2013.v009a028}{doi:\nolinkurl{10.4086/toc.2013.v009a028}}}
}

@article{KMS17,
  author = {Khot, Subhash and Minzer, Dor and Safra, Muli},
  title = {On Independent Sets, 2-to-2 Games and {Grassmann} Graphs},
  journal = {Theory of Computing},
  volume = {21}, number = {10}, pages = {1--55}, year = {2025},
  doi = {10.4086/toc.2025.v021a010},
  note = {Preliminary version in STOC 2017. \href{https://doi.org/10.4086/toc.2025.v021a010}{doi:\nolinkurl{10.4086/toc.2025.v021a010}}}
}

@article{Gowers2007,
  author = {Gowers, W. Timothy},
  title = {Hypergraph Regularity and the Multidimensional {Szemer\'{e}di} Theorem},
  journal = {Annals of Mathematics},
  volume = {166}, number = {3}, pages = {897--946}, year = {2007},
  doi = {10.4007/annals.2007.166.897},
  note = {\href{https://doi.org/10.4007/annals.2007.166.897}{doi:\nolinkurl{10.4007/annals.2007.166.897}}}
}

@article{GW95,
  author = {Goemans, Michel X. and Williamson, David P.},
  title = {Improved Approximation Algorithms for Maximum Cut and
           Satisfiability Problems Using Semidefinite Programming},
  journal = {Journal of the ACM},
  volume = {42},
  number = {6},
  pages = {1115--1145},
  year = {1995},
  doi = {10.1145/227683.227684},
  url = {https://math.mit.edu/~goemans/PAPERS/maxcut-jacm.pdf},
  note = {\href{https://doi.org/10.1145/227683.227684}{doi:\nolinkurl{10.1145/227683.227684}}}
}

@article{MOO10,
  author = {Mossel, Elchanan and O'Donnell, Ryan and Oleszkiewicz, Krzysztof},
  title = {Noise Stability of Functions with Low Influences:
           Invariance and Optimality},
  journal = {Annals of Mathematics},
  volume = {171},
  number = {1},
  pages = {295--341},
  year = {2010},
  doi = {10.4007/annals.2010.171.295},
  url = {https://annals.math.princeton.edu/2010/171-1/p05},
  note = {\href{https://doi.org/10.4007/annals.2010.171.295}{doi:\nolinkurl{10.4007/annals.2010.171.295}}}
}


@article{BGS1998,
  author = {Bellare, Mihir and Goldreich, Oded and Sudan, Madhu},
  title = {Free Bits, {PCPs}, and Nonapproximability---Towards Tight Results},
  journal = {SIAM Journal on Computing},
  volume = {27},
  number = {3},
  pages = {804--915},
  year = {1998},
  doi = {10.1137/S0097539796302531},
  note = {Preliminary version in FOCS 1995. \href{https://doi.org/10.1137/S0097539796302531}{doi:\nolinkurl{10.1137/S0097539796302531}}}
}

@mastersthesis{Wiman2018,
  author = {Wiman, M{\aa}rten},
  title = {Improved Inapproximability of {Max-Cut} through {Min-Cut}},
  school = {KTH Royal Institute of Technology},
  year = {2018},
  note = {\href{https://www.diva-portal.org/smash/get/diva2:1229467/FULLTEXT01.pdf}{University repository full text}}
}

@inproceedings{Martinsson2024,
  author = {Martinsson, Bj{\"o}rn},
  title = {On the {NP}-Hardness Approximation Curve for {Max-2Lin(2)}},
  booktitle = {Approximation, Randomization, and Combinatorial Optimization.
               Algorithms and Techniques (APPROX/RANDOM 2024)},
  series = {Leibniz International Proceedings in Informatics},
  volume = {317},
  pages = {11:1--11:38},
  publisher = {Schloss Dagstuhl---Leibniz-Zentrum f{\"u}r Informatik},
  year = {2024},
  doi = {10.4230/LIPIcs.APPROX/RANDOM.2024.11},
  note = {\href{https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2024.11}{doi:\nolinkurl{10.4230/LIPIcs.APPROX/RANDOM.2024.11}}}
}