Login / Signup

A polynomial-time algorithm to compute generalized Hermite normal forms of matrices over Z[x].

Rui-Juan JingChun-Ming YuanXiao-Shan Gao
Published in: Theor. Comput. Sci. (2019)
Keyphrases
  • computational complexity
  • worst case
  • normal form
  • learning algorithm
  • optimal solution
  • relational databases
  • k means
  • np hard
  • tree structure
  • objective function
  • database
  • object oriented
  • database design
  • multi valued