The following pages link to (Q3714165):
Displaying 50 items.
- Symbolic powers of monomial curves (Q1121340) (← links)
- On an installation of Buchberger's algorithm (Q1121950) (← links)
- 2D systems feedback compensation: An approach based on commutative linear transformations (Q1123871) (← links)
- A refutational approach to geometry theorem proving (Q1124373) (← links)
- A novel method for analyzing enzyme kinetic systems (Q1126603) (← links)
- A holonomic systems approach to special functions identities (Q1173698) (← links)
- On superG-bases (Q1173723) (← links)
- Algebraic varieties characterizing matroids and oriented matroids (Q1175763) (← links)
- Some examples of the use of distances as coordinates for euclidean geometry (Q1176392) (← links)
- Computational algebraic geometry of projective configurations (Q1176393) (← links)
- On the number of term orders (Q1177866) (← links)
- Equations for the projective closure and effective Nullstellensatz (Q1180147) (← links)
- The membership problem for unmixed polynomial ideals is solvable in single exponential time (Q1180154) (← links)
- A new method for solving algebraic systems of positive dimension (Q1180160) (← links)
- Two-dimensional shift register synthesis and Gröbner bases for polynomial ideals over an integer residue ring (Q1180162) (← links)
- Computing combinatorial decompositions of rings (Q1180429) (← links)
- A Gröbner basis criterion for isomorphisms of algebraic varieties (Q1181461) (← links)
- Algorithms for the Quillen-Suslin theorem (Q1183295) (← links)
- A computational model for algebraic power series (Q1184020) (← links)
- Application of ordered standard bases to catastrophe theory (Q1186706) (← links)
- A faster way to count the solutions of inhomogeneous systems of algebraic equations, with applications to cyclic \(n\)-roots (Q1186712) (← links)
- Standard bases for general coefficient rings and a new constructive proof of Hilbert's basis theorem (Q1186713) (← links)
- A new notion of reduction: Generating universal Gröbner bases of ideals in \(K[x,y]\) (Q1186721) (← links)
- Symbolic parametrization of curves (Q1186722) (← links)
- Mechanical manipulation for a class of differential systems (Q1186742) (← links)
- The inverse of an automorphism in polynomial time (Q1190750) (← links)
- An algorithm for solving parametric linear systems (Q1194335) (← links)
- Three new algorithms for multivariate polynomial GCD (Q1194336) (← links)
- Algorithm for implicitizing rational parametric surfaces (Q1195059) (← links)
- Banded matrices with banded inverses (Q1195391) (← links)
- Irreducible decomposition of algebraic varieties via characteristic sets and Gröbner bases (Q1195755) (← links)
- Nonlinear reduction for solving deficient polynomial systems by continuation methods (Q1195900) (← links)
- On the reconstruction of polynomial automorphisms from their face polynomials (Q1196827) (← links)
- On the derivation and reduction of \(C^ 1\) trigonometric basis functions using Maple\(^{TM}\) (Q1198236) (← links)
- Comprehensive Gröbner bases (Q1199704) (← links)
- Computation of Hilbert functions (Q1199706) (← links)
- An approach to the zero recognition problem by Buchberger algorithm (Q1199821) (← links)
- Using Gröbner bases for detecting polynomial identities: A case study on Fermat's ideal (Q1199983) (← links)
- Solutions of systems of algebraic equations and linear maps on residue class rings (Q1201351) (← links)
- Analysis of approximate factorization algorithm. I (Q1202761) (← links)
- Automorphisms from face polynomials via two Gröbner bases (Q1207520) (← links)
- Implicitization of rational parametric equations (Q1209624) (← links)
- Gröbner bases and primary decomposition of modules (Q1209627) (← links)
- Notes on Gröbner bases (Q1262348) (← links)
- A note on observability tests for general polynomial and simple Wiener-Hammerstein systems (Q1274579) (← links)
- Minimum lag descriptions and minimal Gröbner bases (Q1275157) (← links)
- Gröbner bases for ideals in Laurent polynomial rings and their application to systems of difference equations (Q1290507) (← links)
- A new efficient algorithm for computing Gröbner bases \((F_4)\) (Q1295781) (← links)
- A categorical critical-pair completion algorithm (Q1300576) (← links)
- A computational method for determining strong stabilizability of \(n\)-D systems (Q1300577) (← links)
