Résolution des systèmes d'équations algébriques
From MaRDI portal
Publication:1152212
DOI10.1016/0304-3975(81)90064-5zbMath0459.68013OpenAlexW2055909024WikidataQ56518857 ScholiaQ56518857MaRDI QIDQ1152212
Publication date: 1981
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-3975(81)90064-5
Symbolic computation and algebraic computation (68W30) Polynomial rings and ideals; rings of integer-valued polynomials (13F20) Foundations of algebraic geometry (14A99)
Related Items
An improvement of the rational representation for high-dimensional systems, Estimates of real roots of a system of algebraic equations, Algorithm of polynomial complexity for factoring polynomials and finding the components of varieties in subexponential time, Factorization of polynomials over a finite field and the solution of systems of algebraic equations, An effective algorithm for deciding the solvability of a system of polynomial equations over 𝑝-adic integers, Stickelberger and the Eigenvalue Theorem, Computer algebra: Past and future, Fast and stable polynomial equation solving and its application to computer vision, Probing a set of hyperplanes by lines and related problems, Strong Nœther Position and Stabilized Regularities, Polynomial-time computation of the dimensions of components of algebraic varieties in zero-characteristic, Certified approximate univariate GCDs, Solving systems of algebraic equations by a general elimination method, Polar varieties, real equation solving, and data structures: the hypersurface case, A Pommaret bases approach to the degree of a polynomial ideal, Systems with parameters, or efficiently solving systems of polynomial equations: 33 years later. I, Multigraded Sylvester forms, duality and elimination matrices, Deciding universality of quantum gates, Straight-line programs in geometric elimination theory, Castelnuovo-Mumford regularity and computing the de Rham cohomology of smooth projective varieties, Elimination ideal and bivariate resultant over finite fields, A Fast Algorithm for Computing Macaulay Null Spaces of Bivariate Polynomial Systems, Root isolation of zero-dimensional polynomial systems with linear univariate representation, A geometric view of cryptographic equation solving, Systems with parameters, or efficiently solving systems of polynomial equations: 33 years later. III, Multiplication matrices and ideals of projective dimension zero, Combinatorial dimension theory of algebraic varieties, On computing the intersection of a pair of algebraic surfaces, Generalised characteristic polynomials, On the computation of matrices of traces and radicals of ideals, Complexity of computations in Commutative Division of the USSR Academy of Sciences, Smoothing of real algebraic hypersurfaces by rigid isotopies, Efficient computation of Castelnuovo-Mumford regularity, Semi-implicit representations of surfaces in \(\mathbb P^3\), resultants and applications, Equations for the projective closure and effective Nullstellensatz, The membership problem for unmixed polynomial ideals is solvable in single exponential time, Algebraic closure of a rational function, On the bit complexity of polynomial system solving, Random arithmetic formulas can be reconstructed efficiently, Solving a sparse system using linear algebra, A note on upper bounds for ideal-theoretic problems, Tropical effective primary and dual Nullstellensätze, Ideaux principaux nilpoitnis de dimension maximale dans l'algebre Fq[G d'un groupe abelien fini g], Fast computation of generic bivariate resultants, Solutions of systems of algebraic equations and linear maps on residue class rings, Computation of a specified root of a polynomial system of equations using eigenvectors, Complexity of solving parametric polynomial systems, Decomposition plans for geometric constraint systems. I: Performance measures for CAD, A parametric representation of totally mixed Nash equilibria, Macaulay style formulas for sparse resultants, Multivariate polynomial system solving using intersections of eigenspaces., Explicit formulas for the multivariate resultant., On the Number of Linearly Independent Equations Generated by XL, Complexity of deciding the first-order theory of real closed fields, Nullstellensatz effectif et Conjecture de Serre (Théorème de Quillen-Suslin) pour le Calcul Formel, Subexponential-time computation of isolated primary components of a polynomial ideal, Dimension and depth dependent upper bounds in polynomial ideal theory, An efficient algorithm for decomposing multivariate polynomials and its applications to cryptography, The Approach of Moments for Polynomial Equations, Zero-Equivalence in Function Fields Defined by Algebraic Differential Equations, Thirty years of polynomial system solving, and now?, Matrices in elimination theory, Complexity of deciding Tarski algebra, Systems with parameters, or efficiently solving systems of polynomial equations 33 years later. II, SHARPER COMPLEXITY BOUNDS FOR ZERO-DIMENSIONAL GRÖBNER BASES AND POLYNOMIAL SYSTEM SOLVING, Ideal basis and primary decompositions: case of two variables, Complexity bounds in elimination theory -- a survey., On the complexity of counting components of algebraic varieties, Rayleigh quotient methods for estimating common roots of noisy univariate polynomials, Challenges of symbolic computation: My favorite open problems. With an additional open problem by Robert M. Corless and David J. Jeffrey, A new efficient algorithm for computing Gröbner bases \((F_4)\), Probing the arrangement of hyperplanes, Computation of approximate polynomial GCDs and an extension, Symbolic and numeric methods for exploiting structure in constructing resultant matrices, Important algebraic calculations for \(n\)-variables polynomial codes
Cites Work
