Pages that link to "Item:Q3474891"

The following pages link to The Structure of Polynomial Ideals and Gröbner Bases (Q3474891):

Displaying 50 items.

• Random sampling in computational algebra: Helly numbers and violator spaces (Q277210) (← links)
• Point-curve incidences in the complex plane (Q722326) (← links)
• On the finiteness theorem for rational maps on a variety of general type (Q735095) (← links)
• Explicit polynomial bounds on prime ideals in polynomial rings over fields (Q785750) (← links)
• A decision method for the integrability of differential-algebraic Pfaffian systems (Q895975) (← links)
• Groebner basis methods for multichannel sampling with unknown offsets (Q952393) (← links)
• Degree bounds for Gröbner bases in algebras of solvable type (Q1017676) (← links)
• A fast algorithm for Gröbner basis conversion and its applications (Q1588033) (← links)
• A combinatorial complexity of Gröbner bases (Q1592198) (← links)
• Sums-of-squares formulas over algebraically closed fields (Q1693096) (← links)
• Finding roots of a multivariate polynomial in a linear subspace (Q1800707) (← links)
• Optimal algorithms for the coverability, the subword, the containment, and the equivalence problems for commutative semigroups. (Q1854344) (← links)
• An optimal algorithm for constructing the reduced Gröbner basis of binomial ideals (Q1974694) (← links)
• Degree upper bounds for involutive bases (Q2035622) (← links)
• Degree bounds for Gröbner bases of modules (Q2066953) (← links)
• Computation of Macaulay constants and degree bounds for Gröbner bases (Q2066954) (← links)
• Bounds on the torsion subgroup schemes of Néron-Severi group schemes (Q2089658) (← links)
• Complementary decompositions of monomial ideals and involutive bases (Q2100115) (← links)
• Algorithms for computing greatest common divisors of parametric multivariate polynomials (Q2200294) (← links)
• A bound for a typical differential dimension of systems of linear differential equations (Q2246869) (← links)
• Distinct distances on curves via rigidity (Q2249479) (← links)
• Dimension and depth dependent upper bounds in polynomial ideal theory (Q2284949) (← links)
• Hrushovski's algorithm for computing the Galois group of a linear differential equation (Q2343188) (← links)
• On the complexity of the \(F_5\) Gröbner basis algorithm (Q2343240) (← links)
• Multilevel polynomial partitions and simplified range searching (Q2354673) (← links)
• Efficient Groebner walk conversion for implicitization of geometric objects (Q2388597) (← links)
• A new class of term orders for elimination (Q2455741) (← links)
• Noncyclic covers of knot complements (Q2487751) (← links)
• Effective differential Nullstellensatz for ordinary DAE systems with constant coefficients (Q2509948) (← links)
• Buchberger-Weispfenning theory for effective associative rings (Q2628314) (← links)
• Generalized typical dimension of a graded module (Q2673107) (← links)
• Some properties of coefficients of the Kolchin dimension polynomial (Q2689034) (← links)
• Inequalities for Hilbert functions and primary decompositions (Q3079233) (← links)
• Complexity of a standard basis of a $D$-module (Q3079271) (← links)
• Double-exponential lower bound for the degree of any system of generators of a polynomial prime ideal (Q3079283) (← links)
• The degree of a tropical basis (Q3130817) (← links)
• Gröbner Bases in D-Modules: Application to Bernstein-Sato Polynomials (Q3294887) (← links)
• Complexity of Membership Problems of Different Types of Polynomial Ideals (Q4556588) (← links)
• Gröbner bases over fields with valuations (Q4683176) (← links)
• Maximal directional operators along algebraic varieties (Q5014716) (← links)
• Toward a Mathematical Theory of the Crystallographic Phase Retrieval Problem (Q5027012) (← links)
• On polynomial ideals, their complexity, and applications (Q5055880) (← links)
• The complexity of the coverability, the containment, and the equivalence problems for commutative semigroups (Q5055940) (← links)
• Difference Galois groups under specialization (Q5141747) (← links)
• (Q5205507) (← links)
• Reduction Mod <i>p</i> of Standard Bases (Q5462877) (← links)
• An optimal algorithm for constructing the reduced Gröbner basis of binomial ideals, and applications to commutative semigroups (Q5928894) (← links)
• Learning a performance metric of Buchberger's algorithm (Q6117059) (← links)
• The topology of equivariant Hilbert schemes (Q6162757) (← links)
• Solving polynomial systems over non-fields and applications to modular polynomial factoring (Q6543078) (← links)