The complexity of approximating a nonlinear program (Q1906280)
From MaRDI portal
!
WARNING
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 843647
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The complexity of approximating a nonlinear program |
scientific article; zbMATH DE number 843647 |
Statements
The complexity of approximating a nonlinear program (English)
0 references
12 February 1996
0 references
probabilistically checkable proofs
0 references
maximum of a multivariable polynomial inside a convex polytope
0 references
polynomial time approximation
0 references
interactive proof systems
0 references
0.9293622
0 references
0.9260472
0 references
0.9216033
0 references
0.9178344
0 references
0.9178344
0 references
0.91677016
0 references
0.91238225
0 references
0.91104376
0 references
