First time here? Check out the FAQ!
Hi there! Please sign in
help
tags
users
badges
ALL
UNANSWERED
Ask Your Question
mua's profile - overview
overview
network
karma
followed questions
activity
3
karma
follow
Registered User
member since
2017-05-23 10:50:37 +0100
last seen
2017-10-20 08:37:30 +0100
todays unused votes
30
votes left
1
Question
1k
views
1
answer
no
votes
2017-06-01 15:39:32 +0100
B r u n o
Subresultant algorithm taking a lot of time for higher degree univariate polynomials with coefficients from fraction fields
gcd
univariate_poly
0
Answers
0
Votes
0
0
2
Tags
gcd
× 5
univariate_poly
× 5
4
Badges
●
Notable Question
×
1
Subresultant algorithm taking a lot of time for higher degree univariate polynomials with coefficients from fraction fields
●
Popular Question
×
1
Subresultant algorithm taking a lot of time for higher degree univariate polynomials with coefficients from fraction fields
●
Scholar
×
1
Subresultant algorithm taking a lot of time for higher degree univariate polynomials with coefficients from fraction fields
●
Famous Question
×
1
Subresultant algorithm taking a lot of time for higher degree univariate polynomials with coefficients from fraction fields
Copyright Sage, 2010. Some rights reserved under creative commons license. Content on this site is licensed under a
Creative Commons Attribution Share Alike 3.0
license.
Powered by Askbot version 0.7.59
Please note: Askbot requires javascript to work properly, please enable javascript in your browser,
here is how