Pages that link to "Item:Q1152212"
From MaRDI portal
The following pages link to Résolution des systèmes d'équations algébriques (Q1152212):
Displaying 50 items.
- Root isolation of zero-dimensional polynomial systems with linear univariate representation (Q420751) (← links)
- Random arithmetic formulas can be reconstructed efficiently (Q488050) (← links)
- Solving a sparse system using linear algebra (Q491257) (← links)
- On the computation of matrices of traces and radicals of ideals (Q654040) (← links)
- An efficient algorithm for decomposing multivariate polynomials and its applications to cryptography (Q733509) (← links)
- Fast and stable polynomial equation solving and its application to computer vision (Q847513) (← links)
- Deciding universality of quantum gates (Q876334) (← links)
- Combinatorial dimension theory of algebraic varieties (Q911659) (← links)
- On computing the intersection of a pair of algebraic surfaces (Q913442) (← links)
- Generalised characteristic polynomials (Q916718) (← links)
- A parametric representation of totally mixed Nash equilibria (Q979929) (← links)
- Thirty years of polynomial system solving, and now? (Q1006651) (← links)
- On the complexity of counting components of algebraic varieties (Q1030247) (← links)
- Important algebraic calculations for \(n\)-variables polynomial codes (Q1073772) (← links)
- Estimates of real roots of a system of algebraic equations (Q1077879) (← links)
- Algorithm of polynomial complexity for factoring polynomials and finding the components of varieties in subexponential time (Q1078247) (← links)
- Factorization of polynomials over a finite field and the solution of systems of algebraic equations (Q1078248) (← links)
- Computer algebra: Past and future (Q1098287) (← links)
- Solving systems of algebraic equations by a general elimination method (Q1104981) (← links)
- Complexity of computations in Commutative Division of the USSR Academy of Sciences (Q1173942) (← links)
- Smoothing of real algebraic hypersurfaces by rigid isotopies (Q1175677) (← links)
- Equations for the projective closure and effective Nullstellensatz (Q1180147) (← links)
- The membership problem for unmixed polynomial ideals is solvable in single exponential time (Q1180154) (← links)
- A note on upper bounds for ideal-theoretic problems (Q1185454) (← links)
- Solutions of systems of algebraic equations and linear maps on residue class rings (Q1201351) (← links)
- Complexity of deciding Tarski algebra (Q1264143) (← links)
- A new efficient algorithm for computing Gröbner bases \((F_4)\) (Q1295781) (← links)
- Polynomial-time computation of the dimensions of components of algebraic varieties in zero-characteristic (Q1358904) (← links)
- Certified approximate univariate GCDs (Q1358910) (← links)
- Polar varieties, real equation solving, and data structures: the hypersurface case (Q1361872) (← links)
- Straight-line programs in geometric elimination theory (Q1380007) (← links)
- Complexity bounds in elimination theory -- a survey. (Q1565824) (← links)
- Challenges of symbolic computation: My favorite open problems. With an additional open problem by Robert M. Corless and David J. Jeffrey (Q1581129) (← links)
- Symbolic and numeric methods for exploiting structure in constructing resultant matrices (Q1600039) (← links)
- A Pommaret bases approach to the degree of a polynomial ideal (Q1656829) (← links)
- Systems with parameters, or efficiently solving systems of polynomial equations: 33 years later. I (Q1661547) (← links)
- On the bit complexity of polynomial system solving (Q1734694) (← links)
- Tropical effective primary and dual Nullstellensätze (Q1745195) (← links)
- Matrices in elimination theory (Q1808659) (← links)
- Ideal basis and primary decompositions: case of two variables (Q1821556) (← links)
- Probing the arrangement of hyperplanes (Q1842647) (← links)
- Computation of approximate polynomial GCDs and an extension (Q1854432) (← links)
- Castelnuovo-Mumford regularity and computing the de Rham cohomology of smooth projective varieties (Q1928235) (← links)
- Multiplication matrices and ideals of projective dimension zero (Q1948611) (← links)
- Fast computation of generic bivariate resultants (Q1996880) (← links)
- Subexponential-time computation of isolated primary components of a polynomial ideal (Q2027324) (← links)
- An improvement of the rational representation for high-dimensional systems (Q2121180) (← links)
- Multigraded Sylvester forms, duality and elimination matrices (Q2168825) (← links)
- Systems with parameters, or efficiently solving systems of polynomial equations: 33 years later. III (Q2202706) (← links)
- Complexity of solving parametric polynomial systems (Q2256707) (← links)
