The following pages link to (Q4674258):
Displaying 50 items.
- Border bases for lattice ideals (Q321275) (← links)
- Standard bases in mixed power series and polynomial rings over rings (Q321289) (← links)
- Computing Gröbner bases associated with lattices (Q340181) (← links)
- Double-generic initial ideal and Hilbert scheme (Q509558) (← links)
- Gröbner bases for polynomial systems with parameters (Q607062) (← links)
- F5C: A variant of Faugère's F5 algorithm with reduced Gröbner bases (Q607065) (← links)
- Segments and Hilbert schemes of points (Q641200) (← links)
- Improved decoding of affine-variety codes (Q714109) (← links)
- Minimal free resolutions of some configurations of fat lines (Q744025) (← links)
- HELP: a sparse error locator polynomial for BCH codes (Q780362) (← links)
- The scheme of liftings and applications (Q886955) (← links)
- Quantifying the unstable in linearized nonlinear systems (Q900222) (← links)
- Improved evaluation codes defined by plane valuations (Q982483) (← links)
- Gröbner bases and combinatorics for binary codes (Q985374) (← links)
- A Pommaret bases approach to the degree of a polynomial ideal (Q1656829) (← links)
- A survey on signature-based algorithms for computing Gröbner bases (Q1711995) (← links)
- On the bit complexity of polynomial system solving (Q1734694) (← links)
- Generalization of the F5 algorithm for calculating Gröbner bases for polynomial ideals (Q1956953) (← links)
- Bar code for monomial ideals (Q1994120) (← links)
- Buchberger-Zacharias theory of multivariate Ore extensions (Q2013546) (← links)
- On the use of Buchberger criteria in \(\mathrm G^2\mathrm V\) algorithm for calculating Gröbner bases (Q2017754) (← links)
- Degree upper bounds for involutive bases (Q2035622) (← links)
- Computation of Macaulay constants and degree bounds for Gröbner bases (Q2066954) (← links)
- Effective algorithm for computing Noetherian operators of zero-dimensional ideals (Q2100118) (← links)
- Standard bases over Euclidean domains (Q2200296) (← links)
- Symmetric decomposition of the associated graded algebra of an Artinian Gorenstein algebra (Q2200938) (← links)
- Grete Hermann and effective methods in geometry (Q2230636) (← links)
- The F5 criterion revised (Q2275900) (← links)
- Flat families by strongly stable ideals and a generalization of Gröbner bases (Q2275904) (← links)
- Dimension and depth dependent upper bounds in polynomial ideal theory (Q2284949) (← links)
- Zacharias representation of effective associative rings (Q2284968) (← links)
- Involutive bases algorithm incorporating F\(_5\) criterion (Q2437322) (← links)
- Gröbner bases of Hilbert ideals of alternating groups (Q2457376) (← links)
- Gröbner basis approach to list decoding of algebraic geometry codes (Q2460910) (← links)
- An algorithmic approach to resolutions (Q2466869) (← links)
- A new algorithm for computing staggered linear bases (Q2687265) (← links)
- Recursive structures in involutive bases theory (Q2701027) (← links)
- The Approach of Moments for Polynomial Equations (Q2802518) (← links)
- Multiple zeros of nonlinear systems (Q3094284) (← links)
- Computing Equilibrium Points of Genetic Regulatory Networks (Q3642959) (← links)
- An FGLM-like algorithm for computing the radical of a zero-dimensional ideal (Q4599692) (← links)
- The Generalized Rabinowitsch Trick (Q4610007) (← links)
- Toward a theory of monomial preorders (Q4640331) (← links)
- (Q4691783) (← links)
- Computing an Invariant of a Linear Code (Q5014679) (← links)
- Smoothable Gorenstein Points Via Marked Schemes and Double-generic Initial Ideals (Q5070643) (← links)
- On the construction of staggered linear bases (Q5157738) (← links)
- From grids to pseudo-grids of lines: Resolution and seminormality (Q5163447) (← links)
- (Q5205507) (← links)
- Ideals, Varieties, and Algorithms (Q5245268) (← links)
