The Worst-Case Step in Karmarkar's Algorithm (Q3829348)
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: The Worst-Case Step in Karmarkar's Algorithm |
scientific article; zbMATH DE number 4104708
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The Worst-Case Step in Karmarkar's Algorithm |
scientific article; zbMATH DE number 4104708 |
Statements
The Worst-Case Step in Karmarkar's Algorithm (English)
0 references
1989
0 references
tight bounds
0 references
Karmarkar's projective algorithm
0 references
worst-case reduction
0 references
0.8903276324272156
0 references
0.8343717455863953
0 references
0.8324303030967712
0 references
0.8283621072769165
0 references
0.8278890252113342
0 references
