Skip to main content


eCommons@Cornell

eCommons@Cornell >
College of Engineering >
Computer Science >
Computer Science Technical Reports >

Please use this identifier to cite or link to this item: http://hdl.handle.net/1813/6939
Title: Quadratic Programming is in NP
Authors: Vavasis, Stephen A.
Keywords: computer science
technical report
Issue Date: Feb-1990
Publisher: Cornell University
Citation: http://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR90-1099
Abstract: Quadratic programming is an important example of optimization with applications to engineering design, coombinatorical optimization, game theory, and economics. Garey and Johnson [1979] state that quadratic programming is NP-hard. In this report we show that it lies in NP, thereby proving that it is NP-complete.
URI: http://hdl.handle.net/1813/6939
Appears in Collections:Computer Science Technical Reports

Files in This Item:

File Description SizeFormat
90-1099.pdf830.42 kBAdobe PDFView/Open
90-1099.ps261.05 kBPostscriptView/Open

Refworks Export

Items in eCommons are protected by copyright, with all rights reserved, unless otherwise indicated.

 

© 2014 Cornell University Library Contact Us