|
A New Efficient Algorithm for Computing SAGBI-Grobner Bases in Invariant Rings
|
|
1390 - 11
|
|
|
Computing Primary Decomposition of Zero-dimensional Ideals over Finite Fields
|
|
1390 - 06
|
|
|
Detecting Unnecessary Reductions in Computing Grobner Bases over Galois Rings
|
|
1390 - 06
|
|
|
Computing Minimal Polynomial of Parametric Matrices
|
|
1390 - 03
|
|
|
Classification of Cubic Curves by Grobner Systems
|
|
1389 - 08
|
|
|
Grobner Basis Theory and Applications
|
|
1389 - 08
|
|
|
Computing Minimal Polynomial of Matrices by Grobner Bases
|
|
1389 - 06
|
|
|
Using Buchberger s Criteria for Computing Comprehensive Grobner Bases
|
|
1389 - 06
|
|
|
A Hybrid Algorithm for Solving 7 Parameters Transformation
|
|
1388 - 07
|
|
|
Extended F5 Criteria
|
|
1388 - 03
|
|
|
Efficient Algorithms for Computing Noether Normalization
|
|
1386 - 09
|
|
|
Efficient Computation of Syzygies by Faugere s F5 algorithm
|
|
1386 - 09
|
|