The following pages link to (Q3341887):
Displaying 48 items.
- Computing Gröbner bases associated with lattices (Q340181) (← links)
- Noise-tolerant algebraic method for reconstruction of nonlinear dynamical systems (Q341708) (← links)
- Simple varieties for limited precision points (Q385012) (← links)
- Pivoting in extended rings for computing approximate Gröbner bases (Q691644) (← links)
- Improved decoding of affine-variety codes (Q714109) (← links)
- Approximate computation of zero-dimensional polynomial ideals (Q731932) (← links)
- Finite sets of \(d\)-planes in affine space (Q837030) (← links)
- The algebra of interpolatory cubature formulæ for generic nodes (Q892808) (← links)
- Computing the state difference equations for discrete overdetermined linear \(m \operatorname{D}\) systems (Q899299) (← links)
- On the pointwise limits of bivariate Lagrange projectors (Q927775) (← links)
- A bivariate preprocessing paradigm for the Buchberger-Möller algorithm (Q989141) (← links)
- Stable border bases for ideals of points (Q999088) (← links)
- Almost vanishing polynomials for sets of limited precision points (Q1034545) (← links)
- History and basic features of the critical-pair/completion procedure (Q1103414) (← links)
- Minimally generating ideals of rational parametric curves in polynomial time (Q1582298) (← links)
- Verification of a low-degree polynomial vanishing at empirical points (Q1671738) (← links)
- A two-dimensional improvement for Farr-Gao algorithm (Q1691951) (← links)
- Learning algebraic varieties from samples (Q1790935) (← links)
- From algebraic sets to monomial linear bases by means of combinatorial algorithms (Q1893979) (← links)
- Multivariate interpolation: preserving and exploiting symmetry (Q2029002) (← links)
- Degröbnerization: a political manifesto (Q2100110) (← links)
- Computing syzygies in finite dimension using fast linear algebra (Q2192678) (← links)
- Algebraic dependency models of protein signal transduction networks from time-series data (Q2194919) (← links)
- Fast amortized multi-point evaluation (Q2238846) (← links)
- Flat families by strongly stable ideals and a generalization of Gröbner bases (Q2275904) (← links)
- Gröbner bases of ideals defined by functionals with an application to ideals of projective points (Q2366274) (← links)
- Prony's method in several variables: symbolic solutions by universal interpolation (Q2399865) (← links)
- Inverse multivariate polynomial root-finding: numerical implementations of the affine and projective Buchberger-Möller algorithm (Q2400307) (← links)
- On the unique representation of very strong algebraic geometry codes (Q2436568) (← links)
- Computing zero-dimensional schemes (Q2456531) (← links)
- Gröbner basis approach to list decoding of algebraic geometry codes (Q2460910) (← links)
- The vanishing ideal of a finite set of closed points in affine space (Q2475109) (← links)
- Vector space bases associated to vanishing ideals of points (Q2655003) (← links)
- Symmetry in multivariate ideal interpolation (Q2674003) (← links)
- Gröbner bases, H-bases and interpolation (Q2706613) (← links)
- Some Combinatorial Applications of Gröbner Bases (Q3014931) (← links)
- Subideal border bases (Q3168745) (← links)
- From Oil Fields to Hilbert Schemes (Q3576570) (← links)
- Lagrange interpolation on subgrids of tensor product grids (Q4433126) (← links)
- The Big Mother of all Dualities: Möller Algorithm (Q4801395) (← links)
- The Number of Gröbner Bases in Finite Fields (Research) (Q5118668) (← links)
- On evaluating multivariate polynomials over finite fields (Q5233898) (← links)
- Computing all border bases for ideals of points (Q5383882) (← links)
- Gröbner bases and generalized Padé approximation (Q5713240) (← links)
- الگوریتمی برای محاسبه ی ایده آل های مرتب نقاط و کاربردهای آن در مدل های زیست شناسی (Q5868341) (← links)
- Multivariate polynomial interpolation with perturbed data (Q5963406) (← links)
- Towards a Gröbner-free approach to coding (Q6146596) (← links)
- Efficient NIZKs for algebraic sets (Q6157547) (← links)
