Fast computation of discrete invariants associated to a differential rational mapping

Authors:
G. Matera;A. Sedoglavic
Affiliations:
Instituto de Desarrollo Humano, Universidad Nacional de General Sarmiento, Campus Universitario, José M. Gutiérrez 1150 (1613) Los Polvorines, Pcia. de Buenos Aires, Argentina;LIFL, Université Lille I, F-59655 Villeneuve d'Ascq Cedex, France
Venue:
Journal of Symbolic Computation - Special issue: International symposium on symbolic and algebraic computation (ISSAC 2002)
Year:
2003

Citing 18
Cited 2

Feasible arithmetic computations: Valiant's hypothesis

Journal of Symbolic Computation
Structural complexity 1

Structural complexity 1
On the computational complexity of polynomials and bilinear mappings

Proceedings of the 5th international conference, AAECC-5 on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
Matrix multiplication via arithmetic progressions

Journal of Symbolic Computation - Special issue on computational algebraic complexity
Algebraic complexity theory

Handbook of theoretical computer science (vol. A)
Polynomial and matrix computations (vol. 1): fundamental algorithms

Polynomial and matrix computations (vol. 1): fundamental algorithms
Representation for the radical of a finitely generated differential ideal

ISSAC '95 Proceedings of the 1995 international symposium on Symbolic and algebraic computation
Modern computer algebra

Modern computer algebra
Fast Probabilistic Algorithms for Verification of Polynomial Identities

Journal of the ACM (JACM)
Factorization-free decomposition algorithms in differential algebra

Journal of Symbolic Computation - Special issue on symbolic computation in algebra, analysis and geometry
How to compute fast a function and all its derivatives: a variation on the theorem of Baur-strassen

ACM SIGACT News
Geometric completion of differential systems using numeric-symbolic continuation

ACM SIGSAM Bulletin
Triviality and Dimension of a System of Algebraic Differential Equations

Journal of Automated Reasoning
A probabilistic algorithm to test local algebraic observability in polynomial time

Journal of Symbolic Computation - Computer algebra: Selected papers from ISSAC 2001
How Lower and Upper Complexity Bounds Meet in Elimination Theory

AAECC-11 Proceedings of the 11th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
Probabilistic algorithms for sparse polynomials

EUROSAM '79 Proceedings of the International Symposiumon on Symbolic and Algebraic Computation
The differential Hilbert function of a differential rational mapping can be computed in polynomial time

Proceedings of the 2002 international symposium on Symbolic and algebraic computation
Algebraic Complexity Theory

Algebraic Complexity Theory

On the complexity of the resolvent representation of some prime differential ideals

Journal of Complexity
On the complexity of the resolvent representation of some prime differential ideals

Journal of Complexity

Quantified Score

Hi-index	0.00

Visualization

Abstract

We exhibit probabilistic algorithms which compute the differentiation index, the differential Hilbert function and an algebraic parametric set associated to a differential rational mapping. These algorithms are based on a process of linearization and specialization in a genetic solution, and have polynomial time complexity.