Black-box polynomial resultants

DOI10.1016/S0020-0190(97)00016-1zbMATH Open1336.68308OpenAlexW2091148036MaRDI QIDQ286994FDOQ286994

Authors: 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

Recommendations

• scientific article; zbMATH DE number 1254255
• An algorithm for symbolic-numeric sparse interpolation of multivariate polynomials whose degree bounds are unknown
• Computing with polynomials given by black boxes for their evaluations: greatest common divisors, factorization, separation of numerators and denominators
• scientific article; zbMATH DE number 1775436
• Probabilistic algorithms for computing resultants

zbMATH Keywords

computer algebrasymbolic computationimplicit polynomial representation

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30)

Cites Work

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

Cited In (4)

• The black-box query complexity of polynomial summation
• Factoring multivariate polynomials represented by black boxes: a Maple + C implementation
• Title not available (Why is that?)
• Title not available (Why is that?)

Uses Software

• Dagwood

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q286994)