Polynomial-complexity computation of the M-phase vector that maximizes a rank-deficient quadratic formPolynomial-complexity computation of the M-phase vector that maximizes a rank-deficient quadratic form Μεταπτυχιακή Διατριβή 2014-03-242010en Introduction -- 2. Problem statement -- 3. Efficient maximization of rank-deficient quadratic form with a MPSK vector argument -- 4. Algorithmic developmentshttp://creativecommons.org/licenses/by/3.0/Polynomial-complexity computation of the M-phase vector that maximizes a rank-deficient quadratic formChania [Greece]Library of TUC2014-03-24application/pdfhttp://www.library.tuc.gr/artemis/DT2000-0077/DT2000-0077.pdffree Κυριλλίδης Αναστάσιος Καρυστινός Γεώργιος Πολυτεχνείο Κρήτης Computational complexity Polynomials Computer algorithms