Upper Bounds for Norms of Products of Binomials
Mihai Cipu · LMS Journal of Computation and Mathematics · 2004
Abstract This paper deals with the problem of finding the least length of a product of n binomials. A theorem of R. Maltby has shown that the problem is algorithmically solvable for any fixed n. Here, a different proof is presented for this result, and yields improved complexity. The author reports the results of computations of the upper bounds on the least length or Euclidean norm of a product of binomials.