{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T00:40:22Z","timestamp":1760056822485,"version":"build-2065373602"},"reference-count":39,"publisher":"Association for Computing Machinery (ACM)","issue":"5","funder":[{"DOI":"10.13039\/501100000266","name":"EPSRC","doi-asserted-by":"crossref","award":["EP\/W014750\/1, EP\/X040461\/1"],"award-info":[{"award-number":["EP\/W014750\/1, EP\/X040461\/1"]}],"id":[{"id":"10.13039\/501100000266","id-type":"DOI","asserted-by":"crossref"}]},{"name":"Swiss State Secretariat for Education, Research and Innovation","award":["MB22.00026"],"award-info":[{"award-number":["MB22.00026"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["J. ACM"],"published-print":{"date-parts":[[2025,10,31]]},"abstract":"<jats:p>\n            It is well known that solving a (non-convex) quadratic program is\n            <jats:sans-serif>NP<\/jats:sans-serif>\n            -hard. We show that the problem remains hard even if we are only looking for a Karush\u2013Kuhn\u2013Tucker (KKT) point, instead of a global optimum. Namely, we prove that computing a KKT point of a quadratic polynomial over the domain [0,1]\n            <jats:sup>\n              <jats:italic toggle=\"yes\">n<\/jats:italic>\n            <\/jats:sup>\n            is complete for the class\n            <jats:sans-serif>CLS<\/jats:sans-serif>\n            =\n            <jats:sans-serif>PPAD<\/jats:sans-serif>\n            \u2229\n            <jats:sans-serif>PLS<\/jats:sans-serif>\n            .\n          <\/jats:p>","DOI":"10.1145\/3745017","type":"journal-article","created":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T06:17:44Z","timestamp":1750313864000},"page":"1-48","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["The Complexity of Computing KKT Solutions of Quadratic Programs"],"prefix":"10.1145","volume":"72","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0791-4342","authenticated-orcid":false,"given":"John","family":"Fearnley","sequence":"first","affiliation":[{"name":"University of Liverpool","place":["Liverpool, United Kingdom"]}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5436-7890","authenticated-orcid":false,"given":"Paul","family":"Goldberg","sequence":"additional","affiliation":[{"name":"University of Oxford","place":["Oxford, United Kingdom"]}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5255-9349","authenticated-orcid":false,"given":"Alexandros","family":"Hollender","sequence":"additional","affiliation":[{"name":"University of Oxford","place":["Oxford, United Kingdom"]}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1262-7831","authenticated-orcid":false,"given":"Rahul","family":"Savani","sequence":"additional","affiliation":[{"name":"The Alan Turing Institute","place":["London, United Kingdom"]},{"name":"University of Liverpool","place":["London, United Kingdom"]}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2025,10,9]]},"reference":[{"key":"e_1_3_4_2_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.aim.2021.108119"},{"key":"e_1_3_4_3_2","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-021-01714-2"},{"key":"e_1_3_4_4_2","doi-asserted-by":"publisher","DOI":"10.1007\/s10957-021-01980-2"},{"key":"e_1_3_4_5_2","doi-asserted-by":"publisher","DOI":"10.1145\/3406325.3451039"},{"key":"e_1_3_4_6_2","doi-asserted-by":"publisher","DOI":"10.1007\/bf01585569"},{"key":"e_1_3_4_7_2","doi-asserted-by":"publisher","DOI":"10.1023\/A:1026583532263"},{"key":"e_1_3_4_8_2","doi-asserted-by":"crossref","unstructured":"S\u00e9bastien Bubeck. 2014. Convex optimization: Algorithms and complexity. In Foundations and Trends in Machine Learning 8 3\u20134 (2014) 231\u2013357.","DOI":"10.1561\/2200000050"},{"key":"e_1_3_4_9_2","doi-asserted-by":"publisher","DOI":"10.1137\/080729529"},{"key":"e_1_3_4_10_2","doi-asserted-by":"publisher","DOI":"10.1145\/1516512.1516516"},{"key":"e_1_3_4_11_2","doi-asserted-by":"publisher","DOI":"10.1145\/3313276.3316400"},{"key":"e_1_3_4_12_2","doi-asserted-by":"publisher","unstructured":"Constantinos Daskalakis Paul W. Goldberg and Christos H. Papadimitriou. 2009. The complexity of computing a Nash equilibrium. SIAM Journal on Computing 39 1 (2009) 195\u2013259. DOI:10.1137\/070699652","DOI":"10.1137\/070699652"},{"key":"e_1_3_4_13_2","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973082.62"},{"key":"e_1_3_4_14_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-15714-1_8"},{"key":"e_1_3_4_15_2","doi-asserted-by":"publisher","DOI":"10.1137\/080720826"},{"key":"e_1_3_4_16_2","doi-asserted-by":"publisher","DOI":"10.1145\/3568163"},{"key":"e_1_3_4_17_2","doi-asserted-by":"publisher","DOI":"10.1145\/195058.195128"},{"key":"e_1_3_4_18_2","doi-asserted-by":"publisher","DOI":"10.1145\/129712.129783"},{"key":"e_1_3_4_19_2","volume-title":"Proceedings of the 20th International Conference on Web and Internet Economics (WINE\u201924)","author":"Ghosh Abheek","year":"2024","unstructured":"Abheek Ghosh and Alexandros Hollender. 2024. The complexity of symmetric bimatrix games with common payoffs. In Proceedings of the 20th International Conference on Web and Internet Economics (WINE\u201924)."},{"key":"e_1_3_4_20_2","doi-asserted-by":"publisher","DOI":"10.1137\/17M1118014"},{"key":"e_1_3_4_21_2","doi-asserted-by":"publisher","DOI":"10.1145\/3406325.3451055"},{"key":"e_1_3_4_22_2","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(88)90046-3"},{"key":"e_1_3_4_23_2","doi-asserted-by":"publisher","DOI":"10.1137\/0219052"},{"key":"e_1_3_4_24_2","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(91)90200-L"},{"key":"e_1_3_4_25_2","doi-asserted-by":"publisher","DOI":"10.4153\/CJM-1965-053-6"},{"key":"e_1_3_4_26_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF02592948"},{"key":"e_1_3_4_27_2","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-0000(05)80063-7"},{"key":"e_1_3_4_28_2","doi-asserted-by":"publisher","DOI":"10.1016\/0167-6377(88)90049-1"},{"key":"e_1_3_4_29_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF00120662"},{"key":"e_1_3_4_30_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF01581088"},{"key":"e_1_3_4_31_2","doi-asserted-by":"publisher","DOI":"10.1016\/0024-3795(91)90267-Z"},{"key":"e_1_3_4_32_2","doi-asserted-by":"publisher","DOI":"10.1137\/15M1039274"},{"key":"e_1_3_4_33_2","doi-asserted-by":"publisher","DOI":"10.1109\/SWAT.1972.23"},{"key":"e_1_3_4_34_2","doi-asserted-by":"publisher","DOI":"10.1137\/0203021"},{"key":"e_1_3_4_35_2","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2023\/321"},{"key":"e_1_3_4_36_2","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(90)90100-c"},{"key":"e_1_3_4_37_2","volume-title":"Proving Polynomial-Time for Sphere-Constrained Quadratic Programming","author":"Vavasis Stephen A.","year":"1990","unstructured":"Stephen A. Vavasis and Richard Zippel. 1990. Proving Polynomial-Time for Sphere-Constrained Quadratic Programming. Technical Report TR90-1182. Cornell University. https:\/\/hdl.handle.net\/1813\/7022"},{"key":"e_1_3_4_38_2","doi-asserted-by":"publisher","DOI":"10.1007\/bf01580903"},{"key":"e_1_3_4_39_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF01581726"},{"key":"e_1_3_4_40_2","doi-asserted-by":"publisher","DOI":"10.1007\/s10107980012a"}],"container-title":["Journal of the ACM"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3745017","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,9]],"date-time":"2025-10-09T13:37:37Z","timestamp":1760017057000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3745017"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,10,9]]},"references-count":39,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2025,10,31]]}},"alternative-id":["10.1145\/3745017"],"URL":"https:\/\/doi.org\/10.1145\/3745017","relation":{},"ISSN":["0004-5411","1557-735X"],"issn-type":[{"type":"print","value":"0004-5411"},{"type":"electronic","value":"1557-735X"}],"subject":[],"published":{"date-parts":[[2025,10,9]]},"assertion":[{"value":"2024-07-24","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2025-05-26","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2025-10-09","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}