Indexed metadata
Minimization of Half-Products
T. Badics, E. Boros
Source abstract
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.
Evidence graph
No public relationships recorded yet.
Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.