The following pages link to (Q3325833):
Displaying 41 items.
- Tangent cone algorithm for homogenized differential operators (Q2456552) (← links)
- On the complexity exponent of polynomial system solving (Q2658549) (← links)
- Algebraic invariants and local stability of planar differential systems (Q2682746) (← links)
- Need Polynomial Systems Be Doubly-Exponential? (Q2819212) (← links)
- A Note on Dynamic Gröbner Bases Computation (Q2830005) (← links)
- A Variant of the F4 Algorithm (Q3073717) (← links)
- Relative Gröbner–Shirshov bases for algebras and groups (Q3079226) (← links)
- Breaking an Identity-Based Encryption Scheme Based on DHIES (Q3104705) (← links)
- A new framework for computing Gröbner bases (Q3450045) (← links)
- Secure PRNGs from Specialized Polynomial Maps over Any $\mathbb{F}_{q}$ (Q3535361) (← links)
- On the Number of Linearly Independent Equations Generated by XL (Q3600445) (← links)
- A Study on Gröbner Basis with Inexact Input (Q3644104) (← links)
- Computing Gröbner Bases within Linear Algebra (Q3644110) (← links)
- (Q3782652) (← links)
- (Q4227291) (← links)
- Multidimensional realisation theory and polynomial system solving (Q4611735) (← links)
- Normal Form Analysis of ℤ2-Equivariant Singularities (Q4630074) (← links)
- Computing H-bases via minimal bases for syzygy modules (Q4965915) (← links)
- An algorithmic approach to Chevalley’s Theorem on images of rational morphisms between affine varieties (Q5018379) (← links)
- Semi-Regular Sequences and Other Random Systems of Equations (Q5048628) (← links)
- Toric eigenvalue methods for solving sparse polynomial systems (Q5097381) (← links)
- On the construction of staggered linear bases (Q5157738) (← links)
- (Q5205507) (← links)
- Alternative algorithms for computing generic μ∗-sequences and local Euler obstructions of isolated hypersurface singularities (Q5230123) (← links)
- Efficient computation of Castelnuovo-Mumford regularity (Q5389451) (← links)
- (Q5687439) (← links)
- Matrix-F5 algorithms over finite-precision complete discrete valuation fields (Q5891054) (← links)
- An optimal algorithm for constructing the reduced Gröbner basis of binomial ideals, and applications to commutative semigroups (Q5928894) (← links)
- The analytic standard fan of a \(\mathcal D\)-module (Q5951554) (← links)
- Refined F5 Algorithms for Ideals of Minors of Square Matrices (Q6081937) (← links)
- An estimator for the hardness of the MQ problem (Q6103087) (← links)
- Breaking rainbow takes a weekend on a laptop (Q6104343) (← links)
- On the complexity of solving generic overdetermined bilinear systems (Q6163795) (← links)
- On the computation of Gröbner bases for matrix-weighted homogeneous systems (Q6543085) (← links)
- A parametric \(\mathrm{F}_4\) algorithm (Q6571583) (← links)
- Algebraic approaches for the design of simultaneous observers for linear systems (Q6598689) (← links)
- A single exponential time algorithm for homogeneous regular sequence tests (Q6601873) (← links)
- Improvement of an incremental signature-based comprehensive Gröbner system algorithm (Q6612108) (← links)
- Signature-based standard basis algorithm under the framework of GVW algorithm (Q6615411) (← links)
- The complexity of algebraic algorithms for LWE (Q6637336) (← links)
- An \(\mathfrak{m}\)-adic algorithm for bivariate Gröbner bases (Q6650574) (← links)
