Pages that link to "Item:Q1893979"
From MaRDI portal
The following pages link to From algebraic sets to monomial linear bases by means of combinatorial algorithms (Q1893979):
Displaying 21 items.
- On the unique minimal monomial basis of Birkhoff interpolation problem (Q328235) (← links)
- Stable monomial basis for multivariate Birkhoff interpolation problems (Q464651) (← links)
- A fast algorithm for the multivariate Birkhoff interpolation problem (Q654789) (← links)
- On the existence of certain error formulas for a special class of ideal projectors (Q719349) (← links)
- The discretization for bivariate ideal interpolation (Q738964) (← links)
- HELP: a sparse error locator polynomial for BCH codes (Q780362) (← links)
- Bar code: a visual representation for finite sets of terms and its applications (Q782707) (← links)
- The big mother of all dualities. 2: Macaulay bases (Q857881) (← links)
- A bivariate preprocessing paradigm for the Buchberger-Möller algorithm (Q989141) (← links)
- An algorithm for the discretization of an ideal projector (Q1691952) (← links)
- Multivariate interpolation and standard bases for Macaulay modules (Q1851332) (← links)
- Degröbnerization: a political manifesto (Q2100110) (← links)
- Boolean ideals and their varieties (Q2348121) (← links)
- A fast algorithm for multivariate Hermite interpolation (Q2352099) (← links)
- The lex game and some applications (Q2457356) (← links)
- Expected term bases for generic multivariate Hermite interpolation (Q2460911) (← links)
- Vector space bases associated to vanishing ideals of points (Q2655003) (← links)
- The Vanishing Ideal of a Finite Set of Points with Multiplicity Structures (Q2799566) (← links)
- FINITE SETS OF AFFINE POINTS WITH UNIQUE ASSOCIATED MONOMIAL ORDER QUOTIENT BASES (Q2885386) (← links)
- Towards a Gröbner-free approach to coding (Q6146596) (← links)
- Applications of bar code to involutive divisions and a ``greedy'' algorithm for complete sets (Q6157639) (← links)