Go to the corresponding LIPIcs Volume Portal |
Lagarde, Guillaume ; Nordström, Jakob ; Sokolov, Dmitry ; Swernofsky, Joseph
pdf-format: |
|
@InProceedings{lagarde_et_al:LIPIcs:2020:11757, author = {Guillaume Lagarde and Jakob Nordstr{\"o}m and Dmitry Sokolov and Joseph Swernofsky}, title = {{Trade-Offs Between Size and Degree in Polynomial Calculus}}, booktitle = {11th Innovations in Theoretical Computer Science Conference (ITCS 2020)}, pages = {72:1--72:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-134-4}, ISSN = {1868-8969}, year = {2020}, volume = {151}, editor = {Thomas Vidick}, publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/opus/volltexte/2020/11757}, URN = {urn:nbn:de:0030-drops-117573}, doi = {10.4230/LIPIcs.ITCS.2020.72}, annote = {Keywords: proof complexity, polynomial calculus, polynomial calculus resolution, PCR, size-degree trade-off, resolution, colored polynomial local search} }
Keywords: | proof complexity, polynomial calculus, polynomial calculus resolution, PCR, size-degree trade-off, resolution, colored polynomial local search | |
Collection: | 11th Innovations in Theoretical Computer Science Conference (ITCS 2020) | |
Issue Date: | 2020 | |
Date of publication: | 06.01.2020 |