Name
Title | ||
|---|---|---|
On computing greatest common divisors with polynomials given by black boxes for their evaluations |
Year | DOI | Venue |
|---|---|---|
1995 | 10.1145/220346.220375 | ISSAC |
Keywords | Field | DocType |
black box,greatest common divisor,polynomial time,rational function,monte carlo,symbolic computation | Discrete mathematics,Combinatorics,Polynomial arithmetic,Power sum symmetric polynomial,Classical orthogonal polynomials,Elementary symmetric polynomial,Irreducible fraction,Polynomial greatest common divisor,Factorization of polynomials,Difference polynomials,Mathematics | Conference |
ISBN | Citations | PageRank |
0-89791-699-9 | 9 | 0.72 |
References | Authors | |
22 | 2 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| A. Diaz | 1 | 70 | 7.34 |
| Erich Kaltofen | 2 | 2332 | 261.40 |