On the Computational Complexity of Linear Discrepancy (Q5874541)
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 Computational Complexity of Linear Discrepancy |
scientific article; zbMATH DE number 7651208
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the Computational Complexity of Linear Discrepancy |
scientific article; zbMATH DE number 7651208 |
Statements
7 February 2023
0 references
discrepancy theory
0 references
linear discrepancy
0 references
rounding
0 references
NP-hardness
0 references
On the Computational Complexity of Linear Discrepancy (English)
0 references
0.8763258457183838
0 references
0.8643596768379211
0 references
0.8395199775695801
0 references
