Approximating convex quadratic programming is P-complete
Visualitza/Obre
Estadístiques de LA Referencia / Recolecta
Inclou dades d'ús des de 2022
Cita com:
hdl:2117/370943
Tipus de documentReport de recerca
Data publicació1995
Condicions d'accésAccés obert
Llevat que s'hi indiqui el contrari, els
continguts d'aquesta obra estan subjectes a la llicència de Creative Commons
:
Reconeixement-NoComercial-SenseObraDerivada 4.0 Internacional
Abstract
In this paper we show that the problem of Approximating Convex Quadratic Programming is P-complete. We also consider two approximation problems related to it, Solution Approximation and Value Approximation and show both of these are P-complete. On the other hand, we show that we can approximate in NC those instances of Quadratic Programming (QP) that are "smooth" and "positive". Finally, we present a problem called Product Arrangement of a graph that is similar to Linear Arrangement. We formulate it as a Positive QP and prove that there is an NCAS for those instances that are "dense".
CitacióSerna, M.; Xhafa, F. Approximating convex quadratic programming is P-complete. 1995.
Forma partLSI-95-58-R
Fitxers | Descripció | Mida | Format | Visualitza |
---|---|---|---|---|
1400244601.pdf | 638,9Kb | Visualitza/Obre |