A Lower Bound for Polynomial Calculus with Extension Rule

Research output: Chapter in Book/Report/Conference proceedingConference contributionResearchpeer-review

Original languageEnglish
Title of host publication36th Computational Complexity Conference (CCC 2021)
EditorsValentine Kabanets
Place of PublicationDagstuhl, Germany
PublisherSchloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
Pages21:1-21:18
Volume200
ISBN (Print)978-3-95977-193-1
DOIs
StatePublished - 2021
Event36th Computational Complexity Conference, CCC 2021 - Virtual, Canada
Duration: 20 Jul 202122 Jul 2021

Publication series

NameLeibniz International Proceedings in Informatics (LIPIcs)
PublisherSchloss Dagstuhl -- Leibniz-Zentrum für Informatik

Conference

Conference36th Computational Complexity Conference, CCC 2021
CountryCanada
CityVirtual
Period20/07/2122/07/21

Keywords

  • proof complexity
  • algebraic proofs
  • polynomial calculus

Cite this