The following pages link to (Q3033872):
Displaying 48 items.
- A softly optimal Monte Carlo algorithm for solving bivariate polynomial systems over the integers (Q272196) (← links)
- Approximate Gröbner bases, overdetermined polynomial systems, and approximate GCDs (Q355525) (← links)
- Modular composition modulo triangular sets and applications (Q371190) (← links)
- Root isolation of zero-dimensional polynomial systems with linear univariate representation (Q420751) (← links)
- Relaxed Hensel lifting of triangular sets (Q480691) (← links)
- Polynomial equation solving by lifting procedures for ramified fibers (Q598210) (← links)
- On the computation of matrices of traces and radicals of ideals (Q654040) (← links)
- Evaluation properties of invariant polynomials (Q731933) (← links)
- A commutative algebra approach to linear codes (Q1024390) (← links)
- Determinantal formulae for the solution set of zero-dimensional ideals (Q1181435) (← links)
- A note on upper bounds for ideal-theoretic problems (Q1185454) (← links)
- An algorithm for solving parametric linear systems (Q1194335) (← links)
- Comprehensive Gröbner bases (Q1199704) (← links)
- Lower bounds for diophantine approximations (Q1358914) (← links)
- Computation of real radicals of polynomial ideals. II (Q1380019) (← links)
- Computing Gröbner bases by FGLM techniques in a non-commutative setting (Q1588032) (← links)
- A new algorithm for discussing Gröbner bases with parameters. (Q1599542) (← links)
- Bit complexity for multi-homogeneous polynomial system solving -- application to polynomial minimization (Q1690788) (← links)
- A modular method to compute the rational univariate representation of zero-dimensional ideals (Q1808670) (← links)
- The calculation of radical ideals in positive characteristic (Q1864889) (← links)
- Algorithms to compute the topology of orientable real algebraic surfaces (Q1878477) (← links)
- Complexity results for triangular sets (Q1878489) (← links)
- Deformation techniques for efficient polynomial equation solving. (Q1977143) (← links)
- Homotopy techniques for solving sparse column support determinantal polynomial systems (Q1979422) (← links)
- Deterministic normal position transformation and its applications (Q2006776) (← links)
- Noetherian operators and primary decomposition (Q2066948) (← links)
- Guessing Gröbner bases of structured ideals of relations of sequences (Q2066951) (← links)
- Bit complexity for computing one point in each connected component of a smooth real algebraic set (Q2100045) (← links)
- Computing critical points for invariant algebraic systems (Q2100065) (← links)
- Degröbnerization: a political manifesto (Q2100110) (← links)
- Solving parametric systems of polynomial equations over the reals through Hermite matrices (Q2117425) (← links)
- Gröbner bases and critical values: the asymptotic combinatorics of determinantal systems (Q2132458) (← links)
- Real root finding for low rank linear matrices (Q2175227) (← links)
- Solving determinantal systems using homotopy techniques (Q2229744) (← links)
- Block-Krylov techniques in the context of sparse-FGLM algorithms (Q2284956) (← links)
- An algorithm for computing Grothendieck local residues. I: Shape basis case (Q2319455) (← links)
- Gröbner bases of ideals defined by functionals with an application to ideals of projective points (Q2366274) (← links)
- Gröbner bases techniques for an \(S\)-packing \(k\)-coloring of a graph (Q2401415) (← links)
- Some constructions for real algebraic curves (Q2456595) (← links)
- Linear algebra for computing Gröbner bases of linear recursive multidimensional sequences (Q2628309) (← links)
- Regular representations of finite-dimensional separable semisimple algebras and Gröbner bases (Q2643527) (← links)
- Fast computation of a rational point of a variety over a finite field (Q3420246) (← links)
- An FGLM-like algorithm for computing the radical of a zero-dimensional ideal (Q4599692) (← links)
- Rational Points and Trace Forms on a Finite Algebra over a Real Closed Field (Q5051896) (← links)
- Sum of Squares Decompositions of Polynomials over their Gradient Ideals with Rational Coefficients (Q5883314) (← links)
- Matrix-F5 algorithms over finite-precision complete discrete valuation fields (Q5891054) (← links)
- A Gröbner free alternative for polynomial system solving (Q5938584) (← links)
- Subresultants and the Shape Lemma (Q6045335) (← links)