Monomial bases and polynomial system solving (extended abstract)

Authors:
Ioannis Z. Emiris;Ashutosh Rege
Affiliations:
Computer Science Division, University of California, Berkeley, CA;Computer Science Division, University of California, Berkeley, CA
Venue:
ISSAC '94 Proceedings of the international symposium on Symbolic and algebraic computation
Year:
1994

Citing 13
Cited 5

A new polynomial-time algorithm for linear programming

Combinatorica
Generalised characteristic polynomials

Journal of Symbolic Computation - Special issue on computational algebraic complexity
Motion from point matches: multiple of solutions

International Journal of Computer Vision
How we proved that there are exactly 924 cyclic 7-roots

ISSAC '91 Proceedings of the 1991 international symposium on Symbolic and algebraic computation
A faster way to count the solutions of inhomogeneous systems of algebraic equations, with applications to cyclic n-roots

Journal of Symbolic Computation
LAPACK's user's guide

LAPACK's user's guide
On the computational complexity and geometry of the first-order theory of the reals. Par I: Introduction. Preliminaries. The geometry of semi-algebraic sets. The decision problem for the existential theory of the reals

Journal of Symbolic Computation
Multipolynomial resultants and linear algebra

ISSAC '92 Papers from the international symposium on Symbolic and algebraic computation
The 40 “generic” positions of a parallel robot

ISSAC '93 Proceedings of the 1993 international symposium on Symbolic and algebraic computation
A practical method for the sparse resultant

ISSAC '93 Proceedings of the 1993 international symposium on Symbolic and algebraic computation
On the Newton Polytope of the Resultant

Journal of Algebraic Combinatorics: An International Journal
Systems of Algebraic Equations Solved by Means of Endomorphisms

AAECC-10 Proceedings of the 10th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
An Efficient Algorithm for the Sparse Mixed Resultant

AAECC-10 Proceedings of the 10th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes

Asymptotic acceleration of solving multivariate polynomial systems of equations

STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Controlled iterative methods for solving polynomial systems

ISSAC '98 Proceedings of the 1998 international symposium on Symbolic and algebraic computation
Robust Algorithms for Object Localization

International Journal of Computer Vision
Geometric constraint solving: The witness configuration method

Computer-Aided Design
Subresultants and generic monomial bases

Journal of Symbolic Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper addresses the problem of efficient construction of monomial bases for the coordinate rings of zero-dimensional varieties.