Hi,

at the moment I am writing my bachelor thesis. I use maple to compute

the smith normal form of a matrix.

I would like to know whether there is some information about the complexity of maple's

implementation of the smithForm algorithm (package linearAlgebra).

 

Thanks,

rauraz


Please Wait...