@article{edmonds,
  author = {Jack Edmonds},
  title = {Maximum matching and a polyhedron with {0,1}-vertices},
  journal = {Journal of Research of the National Bureau of Standards, Section B},
  volume = {69B}, number = {1--2}, pages = {125--130}, year = {1965},
  doi = {10.6028/jres.069B.013},
  note = {\href{https://doi.org/10.6028/jres.069B.013}{\nolinkurl{doi:10.6028/jres.069B.013}}}
}

@article{yannakakis,
  author = {Mihalis Yannakakis},
  title = {Expressing combinatorial optimization problems by linear programs},
  journal = {Journal of Computer and System Sciences},
  volume = {43}, number = {3}, pages = {441--466}, year = {1991},
  doi = {10.1016/0022-0000(91)90024-Y},
  note = {\href{https://doi.org/10.1016/0022-0000(91)90024-Y}{\nolinkurl{doi:10.1016/0022-0000(91)90024-Y}}}
}

@article{rothvoss,
  author = {Thomas Rothvo{\ss}},
  title = {The matching polytope has exponential extension complexity},
  journal = {Journal of the ACM},
  volume = {64}, number = {6}, pages = {41:1--41:19}, year = {2017},
  doi = {10.1145/3127497},
  note = {\href{https://doi.org/10.1145/3127497}{\nolinkurl{doi:10.1145/3127497}}}
}

@article{braun-pokutta,
  author = {G{\'a}bor Braun and Sebastian Pokutta},
  title = {The matching problem has no fully polynomial size linear programming relaxation schemes},
  journal = {IEEE Transactions on Information Theory},
  volume = {61}, number = {10}, pages = {5754--5764}, year = {2015},
  doi = {10.1109/TIT.2015.2465864},
  note = {\href{https://doi.org/10.1109/TIT.2015.2465864}{\nolinkurl{doi:10.1109/TIT.2015.2465864}}. Section and theorem numbering refer to arXiv:1403.6710v6}
}

@article{matching-symmetric,
  author = {G{\'a}bor Braun and Jonah Brown-Cohen and Arefin Huq and Sebastian Pokutta and Prasad Raghavendra and Aurko Roy and Benjamin Weitz and Daniel Zink},
  title = {The matching problem has no small symmetric {SDP}},
  journal = {Mathematical Programming},
  volume = {165}, number = {2}, pages = {643--662}, year = {2017},
  doi = {10.1007/s10107-016-1098-z},
  note = {\href{https://doi.org/10.1007/s10107-016-1098-z}{\nolinkurl{doi:10.1007/s10107-016-1098-z}}. Theorem numbering refers to arXiv:1504.00703v5}
}

@article{gpt,
  author = {Jo{\~a}o Gouveia and Pablo A. Parrilo and Rekha R. Thomas},
  title = {Lifts of convex sets and cone factorizations},
  journal = {Mathematics of Operations Research},
  volume = {38}, number = {2}, pages = {248--264}, year = {2013},
  doi = {10.1287/moor.1120.0575},
  note = {\href{https://doi.org/10.1287/moor.1120.0575}{\nolinkurl{doi:10.1287/moor.1120.0575}}}
}

@inproceedings{lrs,
  author = {James R. Lee and Prasad Raghavendra and David Steurer},
  title = {Lower bounds on the size of semidefinite programming relaxations},
  booktitle = {Proceedings of the 47th Annual ACM Symposium on Theory of Computing},
  pages = {567--576}, year = {2015},
  doi = {10.1145/2746539.2746599},
  note = {\href{https://doi.org/10.1145/2746539.2746599}{\nolinkurl{doi:10.1145/2746539.2746599}}. Section and theorem numbering refer to arXiv:1411.6317v1}
}

@article{grigoriev,
  author = {Dima Grigoriev},
  title = {Linear lower bound on degrees of {Positivstellensatz} calculus proofs for the parity},
  journal = {Theoretical Computer Science},
  volume = {259}, number = {1--2}, pages = {613--622}, year = {2001},
  doi = {10.1016/S0304-3975(00)00157-2},
  note = {\href{https://doi.org/10.1016/S0304-3975(00)00157-2}{\nolinkurl{doi:10.1016/S0304-3975(00)00157-2}}}
}

@article{filmus,
  author = {Yuval Filmus},
  title = {An orthogonal basis for functions over a slice of the {Boolean} hypercube},
  journal = {Electronic Journal of Combinatorics},
  volume = {23}, number = {1}, pages = {P1.23}, year = {2016},
  doi = {10.37236/4567},
  note = {\href{https://doi.org/10.37236/4567}{\nolinkurl{doi:10.37236/4567}}}
}

@article{gowers,
  author = {W. T. Gowers},
  title = {Quasirandom groups},
  journal = {Combinatorics, Probability and Computing},
  volume = {17}, number = {3}, pages = {363--387}, year = {2008},
  doi = {10.1017/S0963548307008826},
  note = {\href{https://doi.org/10.1017/S0963548307008826}{\nolinkurl{doi:10.1017/S0963548307008826}}. Lemma numbering refers to arXiv:0710.3877v1}
}

@article{helstrom,
  author = {Carl W. Helstrom},
  title = {Detection theory and quantum mechanics},
  journal = {Information and Control},
  volume = {10}, number = {3}, pages = {254--291}, year = {1967},
  doi = {10.1016/S0019-9958(67)90302-6},
  note = {\href{https://doi.org/10.1016/S0019-9958(67)90302-6}{\nolinkurl{doi:10.1016/S0019-9958(67)90302-6}}}
}

@article{fsp-sparse,
  author = {Hamza Fawzi and James Saunderson and Pablo A. Parrilo},
  title = {Sparse sums of squares on finite abelian groups and improved semidefinite lifts},
  journal = {Mathematical Programming},
  volume = {160}, number = {1--2}, pages = {149--191}, year = {2016},
  doi = {10.1007/s10107-015-0977-z},
  note = {\href{https://doi.org/10.1007/s10107-015-0977-z}{\nolinkurl{doi:10.1007/s10107-015-0977-z}}. The preprint arXiv:1503.01207v1 is titled ``Sparse sum-of-squares certificates on finite abelian groups''}
}

@inproceedings{kaniewski-lee-dewolf,
  author = {Jedrzej Kaniewski and Troy Lee and Ronald {de Wolf}},
  title = {Query complexity in expectation},
  booktitle = {Automata, Languages, and Programming},
  series = {Lecture Notes in Computer Science},
  volume = {9134}, pages = {761--772}, year = {2015},
  publisher = {Springer},
  doi = {10.1007/978-3-662-47672-7_62},
  note = {\href{https://doi.org/10.1007/978-3-662-47672-7_62}{\nolinkurl{doi:10.1007/978-3-662-47672-7_62}}. Section and theorem numbering refer to arXiv:1411.7280v1}
}

@article{vershik-okounkov,
  author = {Anatoly M. Vershik and Andrei Yu. Okounkov},
  title = {A new approach to the representation theory of the symmetric groups. {II}},
  journal = {Journal of Mathematical Sciences},
  volume = {131}, number = {2}, pages = {5471--5494},
  year = {2005},
  doi = {10.1007/s10958-005-0421-7},
  eprint = {math/0503040v3}, archivePrefix = {arXiv},
  note = {\href{https://doi.org/10.1007/s10958-005-0421-7}{\nolinkurl{doi:10.1007/s10958-005-0421-7}}. Theorem numbering refers to arXiv:math/0503040v3, revised April 20, 2005}
}