Pages that link to "Item:Q1295781"
From MaRDI portal
The following pages link to A new efficient algorithm for computing Gröbner bases \((F_4)\) (Q1295781):
Displaying 50 items.
- Controlled non-uniform random generation of decomposable structures (Q708203) (← links)
- On the decoding of binary cyclic codes with the Newton identities (Q733502) (← links)
- Index calculus for abelian varieties of small dimension and the elliptic curve discrete logarithm problem (Q733510) (← links)
- QUAD: A multivariate stream cipher with provable security (Q733512) (← links)
- Numerical elimination and moduli space of vacua (Q737597) (← 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)
- Detecting binomiality (Q745070) (← links)
- Optimized Lie-Trotter-Suzuki decompositions for two and three non-commuting terms (Q778479) (← links)
- Why you cannot even hope to use Gröbner bases in cryptography: an eternal golden braid of failures (Q780363) (← links)
- Cylinder partition function of the 6-vertex model from algebraic geometry (Q783974) (← links)
- Computing border bases (Q819794) (← links)
- Stream/block ciphers, difference equations and algebraic attacks (Q820950) (← links)
- Stronger bounds on the cost of computing Gröbner bases for HFE systems (Q820971) (← links)
- Testing binomiality of chemical reaction networks using comprehensive Gröbner systems (Q831995) (← links)
- On index calculus algorithms for subfield curves (Q832332) (← links)
- Boolean polynomials, BDDs and CRHS equations -- connecting the dots with CryptaPath (Q832343) (← links)
- Involutive method for computing Gröbner bases over \(\mathbb F_2\) (Q840027) (← links)
- Role of involutive criteria in computing Boolean Gröbner bases (Q840090) (← links)
- Fast and stable polynomial equation solving and its application to computer vision (Q847513) (← links)
- Competitive equilibria in semi-algebraic economies (Q848620) (← links)
- Index calculus in the trace zero variety (Q895005) (← links)
- Real root finding for determinants of linear matrices (Q898255) (← links)
- Generating invariants for non-linear loops by linear algebraic methods (Q903492) (← links)
- On selection of nonmultiplicative prolongations in computation of Janet bases (Q926621) (← links)
- Asymmetric approach to computation of Gröbner bases (Q950850) (← links)
- Determining the global minimum of Higgs potentials via Groebner bases - applied to the NMSSM (Q982780) (← links)
- A generalization of Castelnuovo-Mumford regularity for representations of noncommutative algebras. (Q994276) (← links)
- Thirty years of polynomial system solving, and now? (Q1006651) (← links)
- Solving multiple right hand sides linear equations (Q1009068) (← links)
- Certifying properties of an efficient functional program for computing Gröbner bases (Q1012152) (← links)
- Polybori: A framework for Gröbner-basis computations with Boolean polynomials (Q1030264) (← links)
- On an installation of Buchberger's algorithm (Q1121950) (← links)
- Numerical homotopies to compute generic points on positive dimensional algebraic sets (Q1594830) (← links)
- Computing discrete logarithms in cryptographically-interesting characteristic-three finite fields (Q1620973) (← links)
- Matrix-F5 algorithms and tropical Gröbner bases computation (Q1635284) (← links)
- A stabilized normal form algorithm for generic systems of polynomial equations (Q1639532) (← links)
- Computing comprehensive Gröbner systems: a comparison of two methods (Q1650394) (← links)
- The point decomposition problem over hyperelliptic curves, Toward efficient computation of discrete logarithms in even characteristic (Q1671640) (← links)
- On the last fall degree of zero-dimensional Weil descent systems (Q1690789) (← links)
- Resultant elimination via implicit equation interpolation (Q1691953) (← links)
- Cryptanalysis of matrix-based UOV (Q1696757) (← links)
- Key recovery attack on the cubic ABC Simple Matrix Multivariate Encryption Scheme (Q1698671) (← links)
- Solving a binary puzzle (Q1701670) (← links)
- Sparse FGLM algorithms (Q1711988) (← links)
- A survey on signature-based algorithms for computing Gröbner bases (Q1711995) (← links)
- A polynomial-time algorithm to compute generalized Hermite normal forms of matrices over \(\mathbb{Z} [x]\) (Q1725693) (← links)
- Characteristic decomposition: from regular sets to normal sets (Q1730299) (← links)
- Speeding up the GVW algorithm via a substituting method (Q1730310) (← links)
- Algebraic geometry and Bethe ansatz. I: The quotient ring for BAE (Q1750927) (← links)
