Home
Library
Search
History
Settings
Plans
Log in
Create account
Home
Library
Search
History
Settings
Plans
Log in
Create account
Quadratic programming with one negative eigenvalue is NP-hard
Authors:
Panos M. Pardalos
,
Stephen A. Vavasis
-
Journal of Global Optimization
1991
cited by 512
✨
Checking sign-in…
PDF
Cited by
View BibTeX
Hide BibTeX
View BibTeX
Cite
Quadratic programming with one negative eigenvalue is NP-hard | Litlas