@article{DBLP:journals/siamdm/PitassiU95,
  author       = {Toniann Pitassi and
                  Alasdair Urquhart},
  title        = {The Complexity of the Hajos Calculus},
  journal      = {{SIAM} J. Discret. Math.},
  volume       = {8},
  number       = {3},
  pages        = {464--483},
  year         = {1995},
  url          = {https://doi.org/10.1137/S089548019224024X},
  doi          = {10.1137/S089548019224024X},
  timestamp    = {Sat, 25 Apr 2020 13:56:34 +0200},
  biburl       = {https://dblp.org/rec/journals/siamdm/PitassiU95.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/IwamaST10,
  author       = {Kazuo Iwama and
                  Kazuhisa Seto and
                  Suguru Tamaki},
  title        = {The complexity of the Haj{\'{o}}s calculus for planar graphs},
  journal      = {Theor. Comput. Sci.},
  volume       = {411},
  number       = {7-9},
  pages        = {1182--1191},
  year         = {2010},
  url          = {https://doi.org/10.1016/j.tcs.2009.12.011},
  doi          = {10.1016/J.TCS.2009.12.011},
  timestamp    = {Sat, 30 Sep 2023 10:28:07 +0200},
  biburl       = {https://dblp.org/rec/journals/tcs/IwamaST10.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jsyml/CookR79,
  author       = {Stephen A. Cook and
                  Robert A. Reckhow},
  title        = {The Relative Efficiency of Propositional Proof Systems},
  journal      = {J. Symb. Log.},
  volume       = {44},
  number       = {1},
  pages        = {36--50},
  year         = {1979},
  url          = {https://doi.org/10.2307/2273702},
  doi          = {10.2307/2273702},
  timestamp    = {Sun, 28 May 2017 13:21:54 +0200},
  biburl       = {https://dblp.org/rec/journals/jsyml/CookR79.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/stoc/AlrabiahGKM23,
  author       = {Omar Alrabiah and
                  Venkatesan Guruswami and
                  Pravesh K. Kothari and
                  Peter Manohar},
  editor       = {Barna Saha and
                  Rocco A. Servedio},
  title        = {A Near-Cubic Lower Bound for 3-Query Locally Decodable Codes from
                  Semirandom {CSP} Refutation},
  booktitle    = {Proceedings of the 55th Annual {ACM} Symposium on Theory of Computing,
                  {STOC} 2023, Orlando, FL, USA, June 20-23, 2023},
  pages        = {1438--1448},
  publisher    = {{ACM}},
  year         = {2023},
  url          = {https://doi.org/10.1145/3564246.3585143},
  doi          = {10.1145/3564246.3585143},
  timestamp    = {Mon, 22 May 2023 13:15:17 +0200},
  biburl       = {https://dblp.org/rec/conf/stoc/AlrabiahGKM23.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/fttcs/FlemingKP19,
  author       = {Noah Fleming and
                  Pravesh Kothari and
                  Toniann Pitassi},
  title        = {Semialgebraic Proofs and Efficient Algorithm Design},
  journal      = {Found. Trends Theor. Comput. Sci.},
  volume       = {14},
  number       = {1-2},
  pages        = {1--221},
  year         = {2019},
  url          = {https://doi.org/10.1561/0400000086},
  doi          = {10.1561/0400000086},
  timestamp    = {Mon, 28 Aug 2023 21:43:46 +0200},
  biburl       = {https://dblp.org/rec/journals/fttcs/FlemingKP19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/sigact/RezendeGR22,
  author       = {Susanna F. de Rezende and
                  Mika G{\"{o}}{\"{o}}s and
                  Robert Robere},
  title        = {Guest Column: Proofs, Circuits, and Communication},
  journal      = {{SIGACT} News},
  volume       = {53},
  number       = {1},
  pages        = {59--82},
  year         = {2022},
  url          = {https://doi.org/10.1145/3532737.3532746},
  doi          = {10.1145/3532737.3532746},
  timestamp    = {Mon, 28 Aug 2023 21:30:22 +0200},
  biburl       = {https://dblp.org/rec/journals/sigact/RezendeGR22.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/siglog/PitassiT16,
  author       = {Toniann Pitassi and
                  Iddo Tzameret},
  title        = {Algebraic proof complexity: progress, frontiers and challenges},
  journal      = {{ACM} {SIGLOG} News},
  volume       = {3},
  number       = {3},
  pages        = {21--43},
  year         = {2016},
  url          = {https://doi.org/10.1145/2984450.2984455},
  doi          = {10.1145/2984450.2984455},
  timestamp    = {Fri, 10 Jun 2022 10:35:17 +0200},
  biburl       = {https://dblp.org/rec/journals/siglog/PitassiT16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}