The complexity of approximating a nonlinear program (Q1906280): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4230322 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4230321 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Structure preserving reductions among convex optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Non-deterministic exponential time has two-prover interactive protocols / rank
 
Normal rank
Property / cites work
 
Property / cites work: Arthur-Merlin games: A randomized proof system, and a hierarchy of complexity classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient probabilistically checkable proofs and applications to approximations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2743964 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved non-approximability results / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructing roadmaps of semi-algebraic sets. I: Completeness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4035692 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3682509 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-Prover Protocols---Low Error at Affordable Rates / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the power of multi-prover interactive protocols / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Knowledge Complexity of Interactive Proof Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fully parallelized multi-prover protocols for NEXP-time / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the hardness of approximating minimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maxima for Graphs and a New Proof of a Theorem of Turán / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multi-prover encoding schemes and three-prover proof systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quadratic programming is in NP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for indefinite quadratic programming / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 10:38, 24 May 2024

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