The complexity of approximating a nonlinear program (Q1906280)

From MaRDI portal
scientific article
Language Label Description Also known as
English
The complexity of approximating a nonlinear program
scientific article

    Statements

    The complexity of approximating a nonlinear program (English)
    0 references
    0 references
    0 references
    0 references
    12 February 1996
    0 references
    0 references
    0 references
    0 references
    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