scientific article; zbMATH DE number 3876580
From MaRDI portal
Publication:3341887
zbMATH Open0549.68026MaRDI QIDQ3341887FDOQ3341887
Authors: Bruno Buchberger, Hans-Michael Möller 
Publication date: 1982
Title of this publication is not available (Why is that?)
Recommendations
Symbolic computation and algebraic computation (68W30) Polynomial rings and ideals; rings of integer-valued polynomials (13F20)
Cited In (56)
- Towards a Gröbner-free approach to coding
- الگوریتمی برای محاسبه ی ایده آل های مرتب نقاط و کاربردهای آن در مدل های زیست شناسی
- Efficient NIZKs for algebraic sets
- Gröbner basis approach to list decoding of algebraic geometry codes
- Gröbner bases and generalized Padé approximation
- Vector space bases associated to vanishing ideals of points
- The vanishing ideal of a finite set of closed points in affine space
- Finite sets of \(d\)-planes in affine space
- Learning algebraic varieties from samples
- Gröbner bases, H-bases and interpolation
- Minimally generating ideals of rational parametric curves in polynomial time
- From oil fields to Hilbert schemes
- Some combinatorial applications of Gröbner bases
- On the pointwise limits of bivariate Lagrange projectors
- Computational aspects of multivariate polynomial interpolation: Indexing the coefficients
- A bivariate preprocessing paradigm for the Buchberger-Möller algorithm
- Symmetry in multivariate ideal interpolation
- Multivariate interpolation: preserving and exploiting symmetry
- Gröbner bases of ideals defined by functionals with an application to ideals of projective points
- Prony's method in several variables: symbolic solutions by universal interpolation
- Inverse multivariate polynomial root-finding: numerical implementations of the affine and projective Buchberger-Möller algorithm
- On evaluating multivariate polynomials over finite fields
- On the unique representation of very strong algebraic geometry codes
- Computing all border bases for ideals of points
- Computing the state difference equations for discrete overdetermined linear \(m \operatorname{D}\) systems
- Subideal border bases
- The number of Gröbner bases in finite fields (research)
- Verification of a low-degree polynomial vanishing at empirical points
- Noise-tolerant algebraic method for reconstruction of nonlinear dynamical systems
- Simple varieties for limited precision points
- Stable border bases for ideals of points
- The algebra of interpolatory cubature formulæ for generic nodes
- Fast amortized multi-point evaluation
- Flat families by strongly stable ideals and a generalization of Gröbner bases
- History and basic features of the critical-pair/completion procedure
- Approximate computation of zero-dimensional polynomial ideals
- A two-dimensional improvement for Farr-Gao algorithm
- Multivariate polynomial interpolation with perturbed data
- Working with multivariate polynomials in Maple
- Computing syzygies in finite dimension using fast linear algebra
- Lagrange interpolation on subgrids of tensor product grids
- Improved decoding of affine-variety codes
- Construction and applications of multivariate separators
- Almost vanishing polynomials for sets of limited precision points
- From algebraic sets to monomial linear bases by means of combinatorial algorithms
- Computational Aspects of Polynomial Interpolation in Several Variables
- An algebraic approach to building interpolating polynomials
- Degröbnerization: a political manifesto
- Computing Gröbner bases associated with lattices
- Algebraic dependency models of protein signal transduction networks from time-series data
- The Big Mother of all Dualities: Möller Algorithm
- A proof of the ``Axis of Evil Theorem for distinct points
- Computing zero-dimensional schemes
- Title not available (Why is that?)
- Pivoting in extended rings for computing approximate Gröbner bases
- An algorithm for implicit interpolation
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3341887)
