Go to the corresponding LIPIcs Volume Portal 
Lagarde, Guillaume ; Nordström, Jakob ; Sokolov, Dmitry ; Swernofsky, Joseph
pdfformat: 

@InProceedings{lagarde_et_al:LIPIcs:2020:11757, author = {Guillaume Lagarde and Jakob Nordstr{\"o}m and Dmitry Sokolov and Joseph Swernofsky}, title = {{TradeOffs Between Size and Degree in Polynomial Calculus}}, booktitle = {11th Innovations in Theoretical Computer Science Conference (ITCS 2020)}, pages = {72:172:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {9783959771344}, ISSN = {18688969}, year = {2020}, volume = {151}, editor = {Thomas Vidick}, publisher = {Schloss DagstuhlLeibnizZentrum fuer Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/opus/volltexte/2020/11757}, URN = {urn:nbn:de:0030drops117573}, doi = {10.4230/LIPIcs.ITCS.2020.72}, annote = {Keywords: proof complexity, polynomial calculus, polynomial calculus resolution, PCR, sizedegree tradeoff, resolution, colored polynomial local search} }
Keywords:  proof complexity, polynomial calculus, polynomial calculus resolution, PCR, sizedegree tradeoff, resolution, colored polynomial local search  
Seminar:  11th Innovations in Theoretical Computer Science Conference (ITCS 2020)  
Issue Date:  2020  
Date of publication:  10.01.2020 