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