|
APPLYING BUCHBERGER S CRITERIA FOR COMPUTING GROBNER BASES OVER FINITE-CHAIN RINGS
|
# |
|
|
Computing Minimal Polynomial of Matrices over Algebraic Extension Fields
|
# |
|
|
Minimal polynomial systems for parametric matrices
|
# |
|
|
Applying Buchberger s Criteria on Montes DisPGB Algorithm
|
# |
|
|
Quasi-stability versus Genericity
|
# |
|
|
Comprehensive Involutive Systems
|
# |
|
|
A variant of Gerdt s algorithm for computing involutive bases
|
# |
|
|
Using Grobner bases for factoring polynomials over algebraic extension fields
|
# |
|
|
Efficient Computation of Castelnuovo-Mumford Regularity
|
# |
|
|
Applying IsRewritten Criterion on Buchberger Algorithm
|
# |
|
|
Erratum to A New Algorithm for Discussing Grobner Bases with Parameters J.Symbolic Comput. 33(1-2)(2002) 183-208
|
# |
|
|
Sharper Complexity Bounds for Zero-dimensional Grobner Bases and Polynomial System Solving
|
# |
|
|
A New Solution to the Relative Orientation Problem Using Only 3 Points and the Vertical Direction
|
# |
|
|
Computing Syzygies by Faugere s F5 Algorithm
|
# |
|