No CrossRef data available.
Article contents
Upper Bounds for Norms of Products of Binomials
Published online by Cambridge University Press: 01 February 2010
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.
- Type
- Research Article
- Information
- Copyright
- Copyright © London Mathematical Society 2004
References
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20160921005829826-0840:S1461157000001030:S1461157000001030_inline1.gif?pub-status=live)