Go to the corresponding LIPIcs Volume Portal 
Miksa, Mladen ; NordstrÃ¶m, Jakob
pdfformat: 

@InProceedings{miksa_et_al:LIPIcs:2015:5077, author = {Mladen Miksa and Jakob Nordstr{\"o}m}, title = {{A Generalized Method for Proving Polynomial Calculus Degree Lower Bounds}}, booktitle = {30th Conference on Computational Complexity (CCC 2015)}, pages = {467487}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {9783939897811}, ISSN = {18688969}, year = {2015}, volume = {33}, editor = {David Zuckerman}, publisher = {Schloss DagstuhlLeibnizZentrum fuer Informatik}, address = {Dagstuhl, Germany}, URL = {http://drops.dagstuhl.de/opus/volltexte/2015/5077}, URN = {urn:nbn:de:0030drops50775}, doi = {10.4230/LIPIcs.CCC.2015.467}, annote = {Keywords: proof complexity, polynomial calculus, polynomial calculus resolution, PCR, degree, size, functional pigeonhole principle, lower bound} }
Keywords:  proof complexity, polynomial calculus, polynomial calculus resolution, PCR, degree, size, functional pigeonhole principle, lower bound  
Collection:  30th Conference on Computational Complexity (CCC 2015)  
Issue Date:  2015  
Date of publication:  06.06.2015 