On decomposing systems of polynomial equations with finitely many solutions
From MaRDI portal
Publication:1311615
DOI10.1007/BF01200146zbMath0793.13013OpenAlexW1533615590MaRDI QIDQ1311615
Publication date: 21 August 1994
Published in: Applicable Algebra in Engineering, Communication and Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01200146
Symbolic computation and algebraic computation (68W30) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Computational aspects of higher-dimensional varieties (14Q15) Polynomials, factorization in commutative rings (13P05)
Related Items (17)
Gröbner bases and cocyclic Hadamard matrices ⋮ Solving via Modular Methods ⋮ Classifying partial Latin rectangles ⋮ A factorization algorithm for \(G\)-algebras and its applications ⋮ A characteristic set method for solving Boolean equations and applications in cryptanalysis of stream ciphers ⋮ A solution to the global identification problem in DSGE models ⋮ Chinese Remainder Theorem for bivariate lexicographic Gröbner bases ⋮ Characteristic set algorithms for equation solving in finite fields ⋮ On the efficiency of solving Boolean polynomial systems with the characteristic set method ⋮ Counting and enumerating feasible rotating schedules by means of Gröbner bases ⋮ THE NEXT-TO-MINIMAL SUPERSYMMETRIC EXTENSION OF THE STANDARD MODEL REVIEWED ⋮ Determining the global minimum of Higgs potentials via Groebner bases - applied to the NMSSM ⋮ Triangular sets for solving polynomial systems: a comparative implementation of four methods ⋮ A computational algebraic geometry approach to enumerate Malcev magma algebras over finite fields ⋮ A computational algebraic geometry approach to analyze pseudo-random sequences based on Latin squares ⋮ A primer on ideal theoretical operation in non-commutative polynomial rings ⋮ Recurrence equations and their classical orthogonal polynomial solutions
Uses Software
Cites Work
- New constructive methods in classical ideal theory
- Solving polynomial systems
- Gröbner bases and primary decomposition of polynomial ideals
- Solving zero-dimensional algebraic systems
- Über B. Buchbergers Verfahren, Systeme algebraischer Gleichungen zu lösen
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: On decomposing systems of polynomial equations with finitely many solutions