Black-box polynomial resultants (Q286994)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Black-box polynomial resultants	scientific article

Statements

scholarly article

0 references

Black-box polynomial resultants (English)

0 references

Mark J. Encarnación

0 references

Information Processing Letters

0 references

publication date

26 May 2016

0 references

zbMATH Keywords

computer algebra

0 references

implicit polynomial representation

0 references

symbolic computation

0 references

describes a project that uses

0 references

MaRDI profile type

MaRDI publication profile

0 references

The Calculation of Multivariate Polynomial Resultants

0 references

0 references

0 references

On the efficiency of effective Nullstellensätze

0 references

On the intrinsic complexity of elimination theory

0 references

Computing with polynomials given by black boxes for their evaluations: greatest common divisors, factorization, separation of numerators and denominators

0 references

0 references

Randomized Interpolation and Approximation of Sparse Polynomials

0 references

Fast Probabilistic Algorithms for Verification of Polynomial Identities

0 references

Interpolating polynomials from their values

0 references

0 references

full work available at URL

https://doi.org/10.1016/s0020-0190(97)00016-1

0 references

Identifiers

zbMATH Open document ID

0 references

10.1016/S0020-0190(97)00016-1

0 references

Mathematics Subject Classification ID

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:286994

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q286994&oldid=37412599"