Login / Signup

A fast, low-space algorithm for multiplying dense multivariate polynomials.

Vangalur S. AlagarDavid K. Probst
Published in: ACM Trans. Math. Softw. (1987)
Keyphrases
  • computational complexity
  • search space
  • theoretical analysis
  • np hard
  • learning algorithm
  • cost function
  • multi class
  • objective function
  • complexity analysis