The Calculation of Multivariate Polynomial Resultants

Cited in

(48)

An adjacency algorithm for cylindrical algebraic decompositions of three- dimensional space
Automatic parameterization of rational curves and surfaces. III: Algebraic plane curves
Generation of configuration space obstacles: The case of moving algebraic curves
Counting types of rigid frameworks
Distances from differences of roots of polynomials to the nearest integers
Rank of a Hankel matrix over \({\mathbb{Z}{}} [x_ 1,{\cdots{}},x_ r]\)
A fast method for interpolation using preconditioning
Fast modular transforms
Computational aspects of deciding if all roots of a polynomial lie within the unit circle
Linear recurring sequences for computing the resultant of multivariate polynomials
Primitive polynomial remainder sequences in elimination theory
The efficient calculation of powers of polynomials
Distributed Maple: Parallel computer algebra in networked environments.
Subresultants revisited.
Local box adjacency algorithms for cylindrical algebraic decompositions
Characterization of equilibrium sets for bilinear systems with feedback control
Zur Charakterisierung und Berechnung von symmetrischen Kubaturformeln
Congruence arithmetic algorithms for polynomial real zero determination
Four limit cycles in a predator-prey system of Leslie type with generalized Holling type III functional response
Black-box polynomial resultants
On relations between Jacobians and resultants of polynomials in two variables
On the security properties of Russian standardized elliptic curves
Two-dimensional Hankel theory
The Minimum Root Separation of a Polynomial
Design of imaginary spectrum of LTI systems with delays to manipulate stability regions
Hopf cyclicity and global dynamics for a predator-prey system of Leslie type with simplified Holling type IV functional response
A Petrov‐Galerkin method and boundary approximations for hyperbolic initial boundary‐value problems
Fourth Order Difference Methods for the Initial Boundary-Value Problem for Hyperbolic Equations
QR-algebraic method for approximating zeros of system of polynomials
Detecting algebraic curves in bad position
The resultants method for approximating real fixed points of polynomials
Finding all real zeros of polynomial systems using multi-resultant
Fast norm computation in smooth-degree abelian number fields
Existence of periodic waves in a perturbed generalized BBM equation
Existence and uniqueness of periodic waves for a perturbed sextic generalized BBM equation
Symbolic computation in algebra, geometry, and differential equations
A modular algorithm to compute the resultant of multivariate polynomials over algebraic number fields presented with multiple extensions
A failure probability analysis of a modular algorithm to compute the monic GCD of multivariate polynomials over algebraic number fields \({\mathbb{Q}(\alpha_1,\ldots,\alpha_n)} \)
Iterated resultants and rational functions in real quantifier elimination
A new security evaluation method based on resultant for arithmetic-oriented algorithms
The lowest upper bound on the number of zeros of a class of hyperelliptic abelian integrals
The dynamics of a self-exciting homopolar dynamo system
Oracle complexities for computional geometry of semi-algebraic sets and voronoi diagrams
Fields of algebraic numbers computable in polynomial time. I
Convex hulls of objects bounded by algebraic curves
Decomposition of algebraic sets and applications to weak centers of cubic systems
Computing primitive elements of extension fields
On computing the intersection of a pair of algebraic surfaces

This page was built for publication: The Calculation of Multivariate Polynomial Resultants

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