The complexity of approximating a nonlinear program

descriptionPublicationkeyboard_double_arrow_right Article , Part of book or chapter of book 01 Jul 1993 English Publisher:Springer Science and Business Media LLCJournal:Mathematical Programming, volume 69, pages 429-441 (issn: 0025-5610, eissn: 1436-4646,

Copyright policy )

Authors: Mihir Bellare; Phillip Rogaway;

doi: 10.1007/bf01585569 , 10.1142/9789814354363_0002

The complexity of approximating a nonlinear program

- Summary
- Subjects
- Metrics

Abstract

zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Related Organizations

IBM (United States)
United States
University of California, Davis
United States

Keywords

polynomial time approximation, Nonlinear programming, interactive proof systems, maximum of a multivariable polynomial inside a convex polytope, Quadratic programming, Abstract computational complexity for mathematical programming problems, probabilistically checkable proofs

Impact byBIP!

	selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	43
	popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.	Top 10%
	influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	Top 1%
	impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.	Top 10%