Sciweavers

ICASSP
2008
IEEE
14 years 7 months ago
Efficient computation of the binary vector that maximizes a rank-deficient quadratic form
The maximization of a full-rank quadratic form over a finite alphabet is NP-hard in both a worst-case sense and an average sense. Interestingly, if the rank of the form is not a ...
George N. Karystinos, Athanasios P. Liavas