|
Simple proofs of some theorems in resultant theory
|
# |
1394 - 04 |
|
Deterministically Computing Reduction Numbers of Polynomial Ideals
|
# |
1393 - 06 |
|
An Improvement of Rosenfeld-Grobner Algorithm
|
# |
1393 - 05 |
|
Effective Computation of Radical of Ideals and Its Application to Invariant Theory
|
# |
1393 - 05 |
|
Applications of differential algebra for computing Lie algebras of infinitesimal CR-automorphisms
|
# |
1393 - 04 |
|
Classification of finite rings Theory and algorithm
|
# |
1393 - 04 |
|
Solving Linear System of Equations over Integers with Grobner Bases
|
# |
1393 - 01 |
|
Involutive bases algorithm incorporating F5 criterion
|
# |
1392 - 07 |
|
Invariant G2V Algorithm for Computing SAGBI-Grobner Bases
|
# |
1392 - 06 |
|
Direct solution of the 7 parametrs transformation problem
|
# |
1392 - 01 |
|
On the use of Buchberger criteria in G2V algorithm for calculating Grobner bases
|
# |
1392 - 01 |
|
Computing Minimal Polynomial of Matrices over Algebraic Extension Fields
|
# |
1392 - 01 |
|
A Note on Grobner Bases and Graph colorings
|
# |
1392 - 01 |
|
APPLYING BUCHBERGER S CRITERIA FOR COMPUTING GROBNER BASES OVER FINITE-CHAIN RINGS
|
# |
1392 - 01 |
|
Minimal polynomial systems for parametric matrices
|
# |
1391 - 10 |
|
Applying Buchberger s Criteria on Montes DisPGB Algorithm
|
# |
1391 - 07 |
|
Comprehensive Involutive Systems
|
# |
1391 - 04 |
|
Quasi-stability versus Genericity
|
# |
1391 - 04 |
|
A variant of Gerdt s algorithm for computing involutive bases
|
# |
1391 - 04 |
|
Using Grobner bases for factoring polynomials over algebraic extension fields
|
# |
1391 - 01 |