The projection games conjecture and the hardness of approximation of Super-SAT and related problems (Q2237900)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7415940
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The projection games conjecture and the hardness of approximation of Super-SAT and related problems |
scientific article; zbMATH DE number 7415940 |
Statements
The projection games conjecture and the hardness of approximation of Super-SAT and related problems (English)
0 references
28 October 2021
0 references
projection games conjecture
0 references
inapproximability
0 references
shortest vector problem
0 references
closest vector problem
0 references
learning halfspace problem
0 references
nearest codeword problem
0 references
0 references
0 references
0.774990975856781
0 references
0.7749906778335571
0 references
0.7699223756790161
0 references
