Login / Signup
On the complexity of computing the GCD of two polynomials via Hankel matrices.
Skander Belhaj
Haïthem Ben Kahla
Published in:
ACM Commun. Comput. Algebra (2012)
Keyphrases
</>
worst case
multiscale
pairwise
space complexity
neural network
decision trees
face recognition
computational complexity
sufficient conditions
decision problems
lagrange interpolation