|
F. Boulier:
Hiding computer algebra in dedicated softwares: a project
Abstract
M. Boutin:
A novel approach to structure from motion using custom build invariants
Abstract
R.S. Datta:
Universality of Nash Equilibria
Abstract
J. De Loera:
Two applications of symbolic computation to Combinatorics
Abstract
I. Emiris:
Multihomogeneous resultant matrices
Abstract
A. Khetan:
The sparse resultant of an unmixed bivariate system
Abstract
I. Kogan:
Two Algorithms for a Moving Frame Construction
Abstract
G. Lecerf:
Evaluation Techniques for Polynomial System Solving:
Abstract
A. Leykin:
On parallel computation of Groebner bases
Abstract
J. Little:
An Application of Symbolic Computational Algebra in Signal Processing
Abstract
D. Maclagan:
Toric Regularity
Abstract
E. Mansfield:
Groebner methods for differential-difference systems
Abstract
M. Moreno-Maza:
On recent advances on the theory of regular chains
Abstract
M.E. O'Sullivan:
Decoding of One-Point Codes with Koetter's Algorithm
Abstract
P. Parrilo:
Combining sums of squares and Groebner basis techniques
Abstract
H. Schenck:
Hyperplane arrangements and free resolutions over the exterior algebra
Abstract
W. Sit :
Invertibility of Polynomials in Differential Algebra
Abstract
H. Stetter:
Algorithmic Refinement of an Approximate Basis of a Zero-dimensional :Polynomial Ideal
Abstract
S. Sullivant:
Groebner Bases of Reducible Hierarchical Models
Abstract
L. Zhi:
QR Factoring to Compute the GCD of Univariate Approximate Polynomials
Abstract
|
