Login / Signup

Solvable Brioschi Resolvents.

Blair K. Spearman
Published in: Appl. Algebra Eng. Commun. Comput. (2003)
Keyphrases
  • special case
  • np complete
  • np hard
  • computational complexity
  • objective function
  • concept learning
  • lower bound
  • dynamic programming
  • convex hull
  • training set