Minimization of Half-Products

In this paper a special class of quadratic functions, the so called half-products are considered. It is shown that while the minimization over the set of binary n-vectors for half-products is NP-complete, an ε-approximating solution can be found in polynomial time for any ε > 0.