Pages that link to "Item:Q1401905"
From MaRDI portal
The following pages link to Modular algorithms for computing Gröbner bases. (Q1401905):
Displaying 50 items.
- The solution of the \(1:-3\) resonant center problem in the quadratic case (Q275034) (← links)
- The center problem and composition condition for Abel differential equations (Q281909) (← links)
- Gröbner bases of symmetric ideals (Q386988) (← links)
- The center problem for a \({1:-4}\) resonant quadratic system (Q401099) (← links)
- Groebner basis methods for stationary solutions of a low-dimensional model for a shear flow (Q484466) (← links)
- A modular algorithm to compute the generalized Hermite normal form for \(\mathbb{Z}[x]\)-lattices (Q504418) (← links)
- Isochronicity and linearizability of a planar cubic system (Q511290) (← links)
- An approach to solving systems of polynomials via modular arithmetics with applications (Q645703) (← links)
- Distortion varieties (Q667656) (← links)
- Calculation of first integrals of a two-dimensional ODE system near a degenerate stationary point by computer algebra tools (Q763556) (← links)
- Computing integral bases via localization and Hensel lifting (Q820962) (← links)
- Bistability and oscillations in chemical reaction networks (Q843313) (← links)
- The center problem for a \(2:-3\) resonant cubic Lotka-Volterra system (Q902471) (← links)
- Integrability conditions for Lotka-Volterra planar complex quintic systems (Q974629) (← links)
- A p-adic approach to the computation of Gröbner bases (Q1118653) (← links)
- On lucky ideals for Gröbner basis computations (Q1209625) (← links)
- On lucky primes (Q1260761) (← links)
- A smoothness test for higher codimensions (Q1680162) (← links)
- Linearizability and critical period bifurcations of a generalized Riccati system (Q1749855) (← links)
- Slimgb: Gröbner bases with slim polynomials (Q1958670) (← links)
- Usage of modular techniques for efficient computation of ideal operations (Q1993362) (← links)
- Parallel modular computation of Gröbner and involutive bases (Q2017756) (← links)
- Using semicontinuity for standard bases computations (Q2103533) (← links)
- Modular techniques for noncommutative Gröbner bases (Q2183734) (← links)
- Standard bases over Euclidean domains (Q2200296) (← links)
- Efficient Gröbner bases computation over principal ideal rings (Q2211184) (← links)
- Qualitative studies of some biochemical models (Q2227888) (← links)
- On the modular computation of Gröbner bases with integer coefficients (Q2256652) (← links)
- Computing and using minimal polynomials (Q2307625) (← links)
- Isochronicity and linearizability of planar polynomial Hamiltonian systems (Q2347009) (← links)
- Certifying solutions to overdetermined and singular polynomial systems over \(\mathbb{Q}\) (Q2399868) (← links)
- Parallelization of modular algorithms (Q2430024) (← links)
- Reduced Gröbner bases and Macaulay-Buchberger basis theorem over Noetherian rings (Q2447635) (← links)
- Gröbner bases for families of affine or projective schemes (Q2469230) (← links)
- Giac and GeoGebra – Improved Gröbner Basis Computations (Q2808009) (← links)
- Bad Primes in Computational Algebraic Geometry (Q2819203) (← links)
- An application of regular chain theory to the study of limit cycles (Q2866055) (← links)
- Size of coefficients of lexicographical Gröbner bases: the zero-dimensional, radical and bivariate case (Q2883808) (← links)
- Computation of highly ramified coverings (Q3055203) (← links)
- Efficient Algorithms for Computing Nœther Normalization (Q3597984) (← links)
- (Q3605255) (← links)
- Modular Algorithms for Computing a Generating Set of the Syzygy Module (Q3644105) (← links)
- Local to Global Algorithms for the Gorenstein Adjoint Ideal of a Curve (Q4556565) (← links)
- (Q4790445) (← links)
- Ideals Modulo a Prime (Q4988232) (← links)
- Centers and Limit Cycles of a Generalized Cubic Riccati System (Q5222620) (← links)
- (Q5301678) (← links)
- The use of bad primes in rational reconstruction (Q5501158) (← links)
- Probabilistic Saturations and Alt’s Problem (Q5866512) (← links)
- Matrix-F5 algorithms over finite-precision complete discrete valuation fields (Q5891054) (← links)
