On the complexity of quadratic programming in real number models of computation (Q1338219)
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 complexity of quadratic programming in real number models of computation |
scientific article; zbMATH DE number 695894
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the complexity of quadratic programming in real number models of computation |
scientific article; zbMATH DE number 695894 |
Statements
On the complexity of quadratic programming in real number models of computation (English)
0 references
27 November 1994
0 references
linearly constrained (nonconvex) quadratic programming
0 references
0 references
0.88913345
0 references
0.88264406
0 references
0.88225526
0 references
0 references
0.87508655
0 references
0 references
0.8696423
0 references
0.8680588
0 references
0.86692643
0 references
0.86611354
0 references
