On the bit complexity of sum-of-squares proofs (Q5111411)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On the bit complexity of sum-of-squares proofs |
scientific article; zbMATH DE number 7204532
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the bit complexity of sum-of-squares proofs |
scientific article; zbMATH DE number 7204532 |
Statements
27 May 2020
0 references
sum-of-squares
0 references
combinatorial optimization
0 references
proof complexity
0 references
On the Bit Complexity of Sum-of-Squares Proofs (English)
0 references
0.7950385212898254
0 references
0.7880753874778748
0 references
0.7823887467384338
0 references
0.7823746800422668
0 references
0.7596622109413147
0 references
