|
Volumn , Issue , 1998, Pages 42-49
|
Computing univariate GCDs over number fields
a a |
Author keywords
[No Author keywords available]
|
Indexed keywords
ALGORITHMS;
COMPUTATIONAL COMPLEXITY;
HEURISTIC METHODS;
NUMBER THEORY;
PROBLEM SOLVING;
PRIME-POWER METHODS;
UNIVARIATE POLYNOMIAL GREATEST COMMON DIVISORS (GCD);
POLYNOMIALS;
|
EID: 0032254946
PISSN: None
EISSN: None
Source Type: Conference Proceeding
DOI: None Document Type: Conference Paper |
Times cited : (1)
|
References (0)
|