Intl. Colloquium on Automata, Languages, and Programming, ICALP 2017


Article Details
Title: On the Bit Complexity of Sum-of-Squares Proofs
Article URLs:
Alternative Article URLs:
Authors: Prasad Raghavendra
  • UC Berkeley
Benjamin Weitz
  • UC Berkeley
Sharing: Unknown
Verification: Authors have not verified information
Artifact Evaluation Badge: none
Artifact URLs:
Artifact Correspondence Email Addresses:
NSF Award Numbers: 1106400, 1407779
DBLP Key: conf/icalp/RaghavendraW17
Author Comments:

Discuss this paper and its artifacts below