Black-box polynomial resultants

DOI10.1016/S0020-0190(97)00016-1zbMath1336.68308OpenAlexW2091148036MaRDI QIDQ286994

Mark J. Encarnación

Publication date: 26 May 2016

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0020-0190(97)00016-1

zbMATH Keywords

symbolic computationcomputer algebraimplicit polynomial representation

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30)

Uses Software

• Dagwood

Cites Work

• Interpolating polynomials from their values
• Computing with polynomials given by black boxes for their evaluations: greatest common divisors, factorization, separation of numerators and denominators
• On the intrinsic complexity of elimination theory
• On the efficiency of effective Nullstellensätze
• Fast Probabilistic Algorithms for Verification of Polynomial Identities
• Dagwood
• Randomized Interpolation and Approximation of Sparse Polynomials
• The Calculation of Multivariate Polynomial Resultants
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Black-box polynomial resultants