Go to the corresponding LIPIcs Volume Portal 
Lauria, Massimo ; Nordström, Jakob
pdfformat: 

@InProceedings{lauria_et_al:LIPIcs:2015:5073, author = {Massimo Lauria and Jakob Nordstr{\"o}m}, title = {{Tight SizeDegree Bounds for SumsofSquares Proofs}}, booktitle = {30th Conference on Computational Complexity (CCC 2015)}, pages = {448466}, 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/5073}, URN = {urn:nbn:de:0030drops50736}, doi = {10.4230/LIPIcs.CCC.2015.448}, annote = {Keywords: Proof complexity, resolution, Lasserre, Positivstellensatz, sumsofsquares, SOS, semidefinite programming, size, degree, rank, clique, lower bound} }
Keywords:  Proof complexity, resolution, Lasserre, Positivstellensatz, sumsofsquares, SOS, semidefinite programming, size, degree, rank, clique, lower bound  
Seminar:  30th Conference on Computational Complexity (CCC 2015)  
Issue Date:  2015  
Date of publication:  27.05.2015 