@InProceedings{lechine:LIPIcs.FSTTCS.2023.33,
  author =	{L\'{e}chine, Ulysse},
  title =	{{Revisiting Mulmuley: Simple Proof That Maxflow Is Not in the Algebraic Version of NC}},
  booktitle =	{43rd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2023)},
  pages =	{33:1--33:12},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-304-1},
  ISSN =	{1868-8969},
  year =	{2023},
  volume =	{284},
  editor =	{Bouyer, Patricia and Srinivasan, Srikanth},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2023.33},
  URN =		{urn:nbn:de:0030-drops-194061},
  doi =		{10.4230/LIPIcs.FSTTCS.2023.33},
  annote =	{Keywords: Algebraic complexity, P vs NC, algebraic NC, GCT program}
}