The following pages link to Amir Hashemi (Q382758):
Displaying 50 items.
- Deterministic root finding over finite fields using Graeffe transforms (Q300881) (← links)
- Approximate Gröbner bases, overdetermined polynomial systems, and approximate GCDs (Q355525) (← links)
- Invariant \(\mathrm G^2\mathrm V\) algorithm for computing SAGBI-Gröbner bases (Q382761) (← links)
- Algorithms for computing triangular decomposition of polynomial systems (Q413407) (← links)
- Applications of differential algebra for computing Lie algebras of infinitesimal CR-automorphisms (Q477250) (← links)
- A generic position based method for real root isolation of zero-dimensional polynomial systems (Q480656) (← links)
- A modular algorithm to compute the generalized Hermite normal form for \(\mathbb{Z}[x]\)-lattices (Q504418) (← links)
- Certifying solutions to square systems of polynomial-exponential equations (Q507164) (← links)
- Numerical algorithms for detecting embedded components (Q512360) (← links)
- Parametric FGLM algorithm (Q512366) (← links)
- Extended \(F_5\) criteria (Q607057) (← links)
- Nullstellensätze for zero-dimensional Gröbner bases (Q626612) (← links)
- Applying IsRewritten criterion on Buchberger algorithm (Q638523) (← links)
- Erratum to ``A new algorithm for discussing Gröbner bases with parameters'' [J. Symbolic Comput. 33 (1-2) (2002) 183-208] (Q719764) (← links)
- Reducing the size and number of linear programs in a dynamic Gröbner basis algorithm (Q744015) (← links)
- An algorithm for implicit interpolation (Q744017) (← links)
- Saturations of subalgebras, SAGBI bases, and U-invariants (Q820960) (← links)
- On the complexity and parallel implementation of Hensel's lemma and Weierstrass preparation (Q831966) (← links)
- Testing binomiality of chemical reaction networks using comprehensive Gröbner systems (Q831995) (← links)
- On minimal free resolutions of sub-permanents and other ideals arising in complexity theory (Q1643083) (← links)
- Computing comprehensive Gröbner systems: a comparison of two methods (Q1650394) (← links)
- A Pommaret bases approach to the degree of a polynomial ideal (Q1656829) (← links)
- Universal Gröbner basis for parametric polynomial ideals (Q1662231) (← links)
- On Gröbner bases and Krull dimension of residue class rings of polynomial rings over integral domains (Q1680153) (← links)
- Deterministic genericity for polynomial ideals (Q1680155) (← links)
- Bit complexity for multi-homogeneous polynomial system solving -- application to polynomial minimization (Q1690788) (← links)
- On the last fall degree of zero-dimensional Weil descent systems (Q1690789) (← links)
- A two-dimensional improvement for Farr-Gao algorithm (Q1691951) (← links)
- Relative reduction and Buchberger's algorithm in filtered free modules (Q1701647) (← links)
- Complexity of triangular representations of algebraic sets (Q1714872) (← links)
- Polynomial expressions for non-binomial structures (Q1729687) (← links)
- An equivalence theorem for regular differential chains (Q1733300) (← links)
- On the bit complexity of polynomial system solving (Q1734694) (← links)
- Closed formula for univariate subresultants in multiple roots (Q1736211) (← links)
- Some criteria for Gröbner bases and their applications (Q1757000) (← links)
- On the complexity of the Lickteig-Roy subresultant algorithm (Q1757020) (← links)
- Hilbert quasi-polynomial for order domains and application to coding theory (Q1783726) (← links)
- Computation of Pommaret bases using syzygies (Q1798305) (← links)
- A new solution to the relative orientation problem using only 3 points and the vertical direction (Q1932840) (← links)
- Subresultants in multiple roots (Q1938659) (← links)
- Generalized binomial edge ideals (Q1940424) (← links)
- Affine solution sets of sparse polynomial systems (Q1940920) (← links)
- Usage of modular techniques for efficient computation of ideal operations (Q1993362) (← links)
- Construction of all polynomial relations among Dedekind eta functions of level \(N\) (Q2000261) (← links)
- Invariant algebraic sets and symmetrization of polynomial systems (Q2000262) (← links)
- A general framework for Noetherian well ordered polynomial reductions (Q2000264) (← links)
- Symbolic computation on the partition lattice of an \(n\)-set (Q2000274) (← links)
- Deterministic normal position transformation and its applications (Q2006776) (← links)
- On the use of Buchberger criteria in \(\mathrm G^2\mathrm V\) algorithm for calculating Gröbner bases (Q2017754) (← links)
- A dynamic F4 algorithm to compute Gröbner bases (Q2025446) (← links)
