Pages that link to "Item:Q1318849"
From MaRDI portal
The following pages link to Efficient computation of zero-dimensional Gröbner bases by change of ordering (Q1318849):
Displaying 50 items.
- Random sampling in computational algebra: Helly numbers and violator spaces (Q277210) (← links)
- Polly cracker, revisited (Q285245) (← links)
- On the ideal associated to a linear code (Q326292) (← links)
- Computing Gröbner bases associated with lattices (Q340181) (← links)
- An efficient algorithm for factoring polynomials over algebraic extension field (Q365855) (← links)
- Gröbner bases of symmetric ideals (Q386988) (← links)
- Characterization of relative Gröbner bases (Q390387) (← links)
- On the complexity of the generalized MinRank problem (Q390388) (← links)
- First fall degree and Weil descent (Q405966) (← links)
- On the relation between the MXL family of algorithms and Gröbner basis algorithms (Q414624) (← links)
- Root isolation of zero-dimensional polynomial systems with linear univariate representation (Q420751) (← links)
- Using Gröbner bases for finding the logarithmic part of the integral of transcendental functions (Q432759) (← links)
- Design of Marx generators as a structured eigenvalue assignment (Q472612) (← links)
- An algorithm to compute the adjoint ideal of an affine plane algebraic curve (Q475414) (← links)
- Using symmetries in the index calculus for elliptic curves discrete logarithm (Q484325) (← links)
- Computing characteristic classes of subschemes of smooth toric varieties (Q511874) (← links)
- Parametric FGLM algorithm (Q512366) (← links)
- A normal form algorithm for regular differential chains (Q541963) (← links)
- Constructive \(D\)-module theory with \texttt{Singular} (Q541982) (← links)
- Correcting errors and erasures via the syndrome variety (Q557068) (← links)
- Gröbner bases and wavelet design (Q597059) (← links)
- Obtaining and solving systems of equations in key variables only for the small variants of AES (Q626949) (← links)
- CAD and topology of semi-algebraic sets (Q626978) (← links)
- A baby steps/giant steps probabilistic algorithm for computing roadmaps in smooth bounded real hypersurface (Q629823) (← links)
- Triangularizing kinematic constraint equations using Gröbner bases for real-time dynamic simulation (Q632158) (← links)
- Exact algorithms for the bottleneck Steiner tree problem (Q652535) (← links)
- Computing modular correspondences for abelian varieties (Q661914) (← links)
- Pivoting in extended rings for computing approximate Gröbner bases (Q691644) (← links)
- The \(\mathfrak {sl}_{3}\) Jones polynomial of the trefoil: a case study of \(q\)-holonomic sequences (Q720596) (← links)
- Evaluation properties of invariant polynomials (Q731933) (← links)
- Improvement of FPPR method to solve ECDLP (Q740119) (← 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)
- Computing border bases (Q819794) (← links)
- Stream/block ciphers, difference equations and algebraic attacks (Q820950) (← links)
- On index calculus algorithms for subfield curves (Q832332) (← links)
- Enumeration of finite monomial orderings and combinatorics of universal Gröbner bases (Q840089) (← links)
- Computing with algebraically closed fields (Q846355) (← links)
- Computer algebra for guaranteed accuracy. How does it help? (Q849196) (← links)
- Gröbner bases in asymptotic analysis of perturbed polynomial programs (Q857824) (← links)
- Index calculus in the trace zero variety (Q895005) (← links)
- Real root finding for determinants of linear matrices (Q898255) (← links)
- Recent progress on the elliptic curve discrete logarithm problem (Q908041) (← links)
- On selection of nonmultiplicative prolongations in computation of Janet bases (Q926621) (← links)
- Interpolation in list decoding of Reed-Solomon codes (Q927473) (← links)
- Gröbner bases and Diophantine analysis (Q950419) (← links)
- Determining the global minimum of Higgs potentials via Groebner bases - applied to the NMSSM (Q982780) (← links)
- Gröbner bases and combinatorics for binary codes (Q985374) (← links)
- A bivariate preprocessing paradigm for the Buchberger-Möller algorithm (Q989141) (← links)
- Thirty years of polynomial system solving, and now? (Q1006651) (← links)
