tag:blogger.com,1999:blog-3722233.post109896329727397712..comments2019-12-06T07:15:22.123-05:00Comments on Computational Complexity: Solving an 86-Year Old Open ProblemLance Fortnowhttp://www.blogger.com/profile/06752030912874378610noreply@blogger.comBlogger2125tag:blogger.com,1999:blog-3722233.post-1098979156936810892004-10-28T11:59:00.000-04:002004-10-28T11:59:00.000-04:00Great title!Great title!Shankarhttps://www.blogger.com/profile/02210434919484591869noreply@blogger.comtag:blogger.com,1999:blog-3722233.post-1098971816608756282004-10-28T09:56:00.000-04:002004-10-28T09:56:00.000-04:00I am very sorry to disturb you but I hope you have...I am very sorry to disturb you but I hope you have a few seconds to answer my questions. I have read quite a lot of materials but did not find an answer. (I need it because one of my problems is reduced to IQP)<br />What is a current status of NP-membership of Integer Quadratic Programming?<br />Garey & Johnson mention that the problem of rational QP is in NP if all quadratic coefficients in an objective function are positive. What happens if the problem is defined as Integer QP with positive cofficients. (I have found that it is only proofed that it is in PSPACE, but without restriction on an objective function)Anonymousnoreply@blogger.com