| Article Details | ||
|---|---|---|
| Title: | On the Bit Complexity of Sum-of-Squares Proofs | |
| Article URLs: | ||
| Alternative Article URLs: | ||
| Authors: | Prasad Raghavendra |
|
| Benjamin Weitz |
|
|
| 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: | ||