Efficient computation of zero-dimensional Gröbner bases by change of ordering
From MaRDI portal
Publication:1318849
DOI10.1006/jsco.1993.1051zbMath0805.13007OpenAlexW2059522106WikidataQ55883677 ScholiaQ55883677MaRDI QIDQ1318849
Jean-Charles Faugère, Patrizia Gianni, Daniel Lazard, Ferdinando Mora
Publication date: 5 February 1995
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jsco.1993.1051
Symbolic computation and algebraic computation (68W30) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10)
Related Items
Computing border bases, Stream/block ciphers, difference equations and algebraic attacks, Random sampling in computational algebra: Helly numbers and violator spaces, Polly cracker, revisited, On index calculus algorithms for subfield curves, Gröbner bases and critical values: the asymptotic combinatorics of determinantal systems, Enumeration of finite monomial orderings and combinatorics of universal Gröbner bases, Matrix-F5 algorithms and tropical Gröbner bases computation, Computing with algebraically closed fields, Computer algebra for guaranteed accuracy. How does it help?, Computing zero-dimensional tropical varieties via projections, On the ideal associated to a linear code, Gröbner bases in asymptotic analysis of perturbed polynomial programs, Computing Gröbner bases associated with lattices, Gröbner bases and involutive methods for algebraic and differential equations, Gröbner bases and wavelet design, An efficient algorithm for factoring polynomials over algebraic extension field, The point decomposition problem over hyperelliptic curves, Toward efficient computation of discrete logarithms in even characteristic, Real root finding for low rank linear matrices, Algebraic dependence in generating functions and expansion complexity, A combinatorial result on Gröbner fans with an application to universal Gröbner bases, Gröbner bases of symmetric ideals, Characterization of relative Gröbner bases, On the complexity of the generalized MinRank problem, Computing coupled border bases, On the walk, In-depth comparison of the Berlekamp-Massey-Sakata and the Scalar-FGLM algorithms: the adaptive variants, First fall degree and Weil descent, Index calculus in the trace zero variety, On the last fall degree of zero-dimensional Weil descent systems, Computing syzygies in finite dimension using fast linear algebra, Real root finding for determinants of linear matrices, On the relation between the MXL family of algorithms and Gröbner basis algorithms, Obtaining and solving systems of equations in key variables only for the small variants of AES, CAD and topology of semi-algebraic sets, Minimal involutive bases, Root isolation of zero-dimensional polynomial systems with linear univariate representation, A baby steps/giant steps probabilistic algorithm for computing roadmaps in smooth bounded real hypersurface, Triangularizing kinematic constraint equations using Gröbner bases for real-time dynamic simulation, The Hilbert zonotope and a polynomial time algorithm for universal Gröbner bases., Elliptic curve discrete logarithm problem over small degree extension fields, Using Gröbner bases for finding the logarithmic part of the integral of transcendental functions, Multiplication matrices and ideals of projective dimension zero, Recent progress on the elliptic curve discrete logarithm problem, Integral closures and weight functions over finite fields., Sparse FGLM algorithms, A survey on signature-based algorithms for computing Gröbner bases, On computation of Boolean involutive bases, Application of computer algebra methods for investigation of stationary motions of a gyrostat satellite, Exact algorithms for the bottleneck Steiner tree problem, On selection of nonmultiplicative prolongations in computation of Janet bases, Interpolation in list decoding of Reed-Solomon codes, Design of Marx generators as a structured eigenvalue assignment, An algorithm to compute the adjoint ideal of an affine plane algebraic curve, Characteristic decomposition: from regular sets to normal sets, Computing modular correspondences for abelian varieties, Using symmetries in the index calculus for elliptic curves discrete logarithm, A note on upper bounds for ideal-theoretic problems, Gröbner bases and Diophantine analysis, An algorithm for solving parametric linear systems, Computing characteristic classes of subschemes of smooth toric varieties, Parametric FGLM algorithm, Computing tropical points and tropical links, Fast computation of generic bivariate resultants, Pivoting in extended rings for computing approximate Gröbner bases, A normal form algorithm for regular differential chains, Constructive \(D\)-module theory with \texttt{Singular}, Deterministic normal position transformation and its applications, Correcting errors and erasures via the syndrome variety, Determining the global minimum of Higgs potentials via Groebner bases - applied to the NMSSM, Gröbner bases and combinatorics for binary codes, A comparison of unrestricted dynamic Gröbner basis algorithms, A dynamic F4 algorithm to compute Gröbner bases, A bivariate preprocessing paradigm for the Buchberger-Möller algorithm, The \(\mathfrak {sl}_{3}\) Jones polynomial of the trefoil: a case study of \(q\)-holonomic sequences, Algebraic approaches for solving isogeny problems of prime power degrees, Symbolic-analytic methods for studying equilibrium orientations of a satellite on a circular orbit, Privacy-preserving data splitting: a combinatorial approach, Evaluation properties of invariant polynomials, Thirty years of polynomial system solving, and now?, Improvement of FPPR method to solve ECDLP, An algorithm for implicit interpolation, On the Bézout construction of the resultant, Triangular sets for solving polynomial systems: a comparative implementation of four methods, A modular method to compute the rational univariate representation of zero-dimensional ideals, Symbolic computations of the equilibrium orientations of a system of two connected bodies moving on a circular orbit around the Earth, \textsc{Ciminion}: symmetric encryption based on Toffoli-gates over large finite fields, Computing zeros of analytic mappings: A logarithmic residue approach, Lexicographic Gröbner bases of bivariate polynomials modulo a univariate one, Guessing Gröbner bases of structured ideals of relations of sequences, Radical computations of zero-dimensional ideals and real root counting., Evaluation techniques for zero-dimensional primary decomposition, Symbolic computation for the qualitative theory of differential equations, An algebraic attack to the Bluetooth stream cipher \textsc{E0}, Invariants, patterns and weights for ordering terms, Computing Gröbner bases by FGLM techniques in a non-commutative setting, A fast algorithm for Gröbner basis conversion and its applications, Degröbnerization: a political manifesto, Effective algorithm for computing Noetherian operators of zero-dimensional ideals, The calculation of radical ideals in positive characteristic, A simple method for obtaining relations among factor basis elements for special hyperelliptic curves, Galois/Monodromy Groups for Decomposing Minimal Problems in 3D Reconstruction, Gröbner systems conversion, Polynomial selection for computing Gröbner bases, Linear algebra for computing Gröbner bases of linear recursive multidimensional sequences, The Big Mother of all Dualities: Möller Algorithm, Stable normal forms for polynomial system solving, A new Gröbner basis conversion method based on stabilization techniques, Minimal average degree aberration and the state polytope for experimental designs, Last Fall Degree, HFE, and Weil Descent Attacks on ECDLP, Regular representations of finite-dimensional separable semisimple algebras and Gröbner bases, Implementation of prime decomposition of polynomial ideals over small finite fields, Complexity of Membership Problems of Different Types of Polynomial Ideals, The arithmetic of Jacobian groups of superelliptic cubics, Computing polynomial univariate representations of zero-dimensional ideals by Gröbner basis, Arrays composed from the extended rational cycle, Vector space bases associated to vanishing ideals of points, Gröbner bases techniques for an \(S\)-packing \(k\)-coloring of a graph, On the complexity exponent of polynomial system solving, A factorization algorithm for \(G\)-algebras and its applications, Summation Polynomial Algorithms for Elliptic Curves in Characteristic Two, Symmetry in multivariate ideal interpolation, Chinese Remainder Theorem for bivariate lexicographic Gröbner bases, Lonely points in simplices, An estimator for the hardness of the MQ problem, Cryptanalysis of the TRMS Signature Scheme of PKC’05, Learning a performance metric of Buchberger's algorithm, An efficient method of finding new symplectic schemes for Hamiltonian mechanics problems with the aid of parametric Gröbner bases, Improving bounds on elliptic curve hidden number problem for ECDH key exchange, On the computation of rational solutions of underdetermined systems over a finite field, Cryptanalysis of symmetric primitives over rings and a key recovery attack on \textsf{Rubato}, An FGLM-like algorithm for computing the radical of a zero-dimensional ideal, Jacobi's bound: Jacobi's results translated in Kőnig's, Egerváry's and Ritt's mathematical languages, Spectral norm of a symmetric tensor and its computation, \textsc{Poseidon}2: a faster version of the \textsc{Poseidon} hash function, New design techniques for efficient arithmetization-oriented hash functions: \texttt{Anemoi} permutations and \texttt{Jive} compression mode, Parallelization of modular algorithms, Computational aspects of retrieving a representation of an algebraic geometry code, Matrix-F5 algorithms over finite-precision complete discrete valuation fields, Application of symbolic computation methods for investigation of stationary motions of an axisymmetric satellite, Application of computer algebra methods to investigate the dynamics of the system of two connected bodies moving along a circular orbit, A non-commutative \(F_5\) algorithm with an application to the computation of Loewy layers., Strong non-Noetherity of polynomial reduction, A lattice formulation of the noncommutative F4 procedure, USING GRÖBNER BASES FOR FACTORING POLYNOMIALS OVER ALGEBRAIC EXTENSION FIELDS, Computing zero-dimensional schemes, Conquering inseparability: primary decomposition and multivariate factorization over algebraic function fields of positive characteristic, Algebraic solutions of holomorphic foliations: an algorithmic approach, Gröbner fan and universal characteristic sets of prime differential ideals, Improving the algorithms of Berlekamp and Niederreiter for factoring polynomials over finite fields, Computing strong regular characteristic pairs with Gröbner bases, Solving multivariate polynomial systems and an invariant from commutative algebra, Gröbner basis approach to list decoding of algebraic geometry codes, Algebraic Attacks on the Courtois Toy Cipher, Fast amortized multi-point evaluation, Real Schubert Calculus: Polynomial Systems and a Conjecture of Shapiro and Shapiro, Theorem proving with group presentations: Examples and questions, Change of order for regular chains in positive dimension, Counting and Gröbner bases, A new Sigma approach to multi-summation, Computing separable isogenies in quasi-optimal time, The membrane inclusions curvature equations, Analytical redundancy relations for fault detection and isolation in algebraic dynamic systems, Computation of invariants of finite abelian groups, Detecting algebraic curves in bad position, Rational solutions of Riccati-like partial differential equations, A Gröbner free alternative for polynomial system solving, THE NEXT-TO-MINIMAL SUPERSYMMETRIC EXTENSION OF THE STANDARD MODEL REVIEWED, PROPERTIES OF COMMUTATIVE ASSOCIATION SCHEMES DERIVED BY FGLM TECHNIQUES, Computing Gröbner fans, Computing the radical of an ideal in positive characteristic, Polynomial Equivalence Problems: Algorithmic and Theoretical Aspects, Flat families by strongly stable ideals and a generalization of Gröbner bases, Primary decomposition of zero-dimensional ideals over finite fields, Fast Gröbner basis computation and polynomial reduction for generic bivariate ideals, Block-Krylov techniques in the context of sparse-FGLM algorithms, On types of degenerate critical points of real polynomial functions, On the complexity of computing Gröbner bases for weighted homogeneous systems, Multivariate polynomial interpolation with perturbed data, Decomposition of polynomial sets into characteristic pairs, Fast computation of Gröbner basis of homogeneous ideals of \(\mathbb{F}[x, y\)], Computing and using minimal polynomials, On a Gröbner bases structure associated to linear codes, SHARPER COMPLEXITY BOUNDS FOR ZERO-DIMENSIONAL GRÖBNER BASES AND POLYNOMIAL SYSTEM SOLVING, Computing Gröbner Bases within Linear Algebra, Analysis of the Collision Resistance of RadioGatúnUsing Algebraic Techniques, Hybrid approach for solving multivariate systems over finite fields, Exact Algorithms for Linear Matrix Inequalities, Characterizations of solutions in geochemistry: existence, uniqueness, and precipitation diagram, Complexity of model testing for dynamical systems with toric steady states, An interval global optimization algorithm combining symbolic rewriting and componentwise Newton method applied to control a class of queueing systems, Gröbner bases for finite-temperature quantum computing and their complexity, Accelerated tower arithmetic, On Homogenous Minimal Involutive Varieties, On the complexity of the \(F_5\) Gröbner basis algorithm, Probabilistic Saturations and Alt’s Problem, Heuristic decoding of linear codes using commutative algebra
