| |
Kaltofen, Erich |
 |
|
| |
|
Date Reviewed |
|
 |
|
|
|
| |
1 - 4
of 4 reviews |
|
|
|
|
|
|
| |
Computing with polynomials given by black boxes for their evaluations: greatest common divisors, factorization, separation of numerators and denominators
Kaltofen E. (ed), Trager B. Journal of Symbolic Computation 9(3): 301-320, 1990. Type: Article
Black boxes are a novel implicit representation for multivariate polynomials and rational functions with rational coefficients. Based on this approach, the authors construct an evaluation procedure for the greatest common divisor of a ...... |
May 1 1991 |
|
|
|
|
|
| |
Greatest common divisors of polynomials given by straight-line programs
Kaltofen E. (ed) Journal of the ACM 35(1): 231-264, 1988. Type: Article
This research paper presents two principal results, both of which are algorithms for manipulating polynomials represented by straight-line programs. The first computes the greatest common divisor of a family of multivariate polynomials...... |
Apr 1 1989 |
|
|
|
|
|
| |
Fast parallel absolute irreducibility testing
Kaltofen E. (ed) Journal of Symbolic Computation 1(1): 57-68, 1985. Type: Article
The determination of the irreducibility of a polynomial with coefficients in a given domain is an important natural problem. This paper presents what seems to be the first polynomial algorithm for testing the absolute irreducibility of...... |
Apr 1 1989 |
|
|
|
|
|
| |
Deterministic irreducibility testing of polynomials over large finite fields
Kaltofen E. (ed) Journal of Symbolic Computation 4(1): 77-82, 1987. Type: Article
In this paper the author presents an algorithm to test dense multivariate polynomials over large finite fields for irreducibility in deterministic polynomial time. All previous algorithms have been probabilistic in nature. The running ...... |
Sep 1 1988 |
|
|
|
|
|
|
|
|
| |
|
|
