Computing with polynomials given by black boxes for their evaluations: greatest common divisors, factorization, separation of numerators and denominators (Q923629)
From MaRDI portal
!
WARNING
This is the item page for this Wikibase entity, intended for internal use and editing purposes.
Please use the normal view instead:
scientific article; zbMATH DE number 4171065
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Computing with polynomials given by black boxes for their evaluations: greatest common divisors, factorization, separation of numerators and denominators |
scientific article; zbMATH DE number 4171065 |
Statements
Computing with polynomials given by black boxes for their evaluations: greatest common divisors, factorization, separation of numerators and denominators (English)
0 references
1990
0 references
This paper gives algorithms to factorize multivariate polynomials and compute GCD's of them, where each polynomial is given as a black box, i.e. a procedure that computes a value when input is presented. The results of the computations are similar black boxes that rely on the black boxes of the original polynomials. The algorithms are all in random polynomial time.
0 references
algorithms
0 references
random polynomial time
0 references
multivariate polynomials
0 references
factorization
0 references
GCD
0 references
0 references
0.8469127416610718
0 references
0.8325544595718384
0 references
