Pablo Solernó

Adv. Appl. Math., June, 2023

2021

On Bézout inequalities for non-homogeneous polynomial ideals.

[BibT_eX]

[DOI]

J. Symb. Comput., 2021

2020

Intrinsic Complexity for Constructing Zero-Dimensional Gröbner Bases.

[BibT_eX]

[DOI]

Proceedings of the Computer Algebra in Scientific Computing - 22nd International Workshop, 2020

2016

A decision method for the integrability of differential-algebraic Pfaffian systems.

[BibT_eX]

[DOI]

Adv. Appl. Math., 2016

2015

Degeneracy Loci and Polynomial Equation Solving.

[BibT_eX]

[DOI]

Found. Comput. Math., 2015

2014

Effective differential Nullstellensatz for ordinary DAE systems with constant coefficients.

[BibT_eX]

[DOI]

J. Complex., 2014

2013

Effective Differential Nullstellensatz for Ordinary DAE Systems over the Complex Numbers

[BibT_eX]

[DOI]

CoRR, 2013

2012

Effective Differential Lüroth's Theorem

[BibT_eX]

[DOI]

CoRR, 2012

2011

A geometric index reduction method for implicit systems of differential algebraic equations.

[BibT_eX]

[DOI]

J. Symb. Comput., 2011

Lower complexity bounds for interpolation algorithms.

[BibT_eX]

[DOI]

J. Complex., 2011

2009

Deformation Techniques for Sparse Systems.

[BibT_eX]

[DOI]

Found. Comput. Math., 2009

2006

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

[BibT_eX]

[DOI]

J. Complex., 2006

A linear algebra approach to the differentiation index of generic DAE systems

[BibT_eX]

[DOI]

CoRR, 2006

2004

Computing generators of the ideal of a smooth affine algebraic variety.

[BibT_eX]

[DOI]

Cristina Blanco

J. Symb. Comput., 2004

1997

On Intrinsic Bounds in the Nullstellensatz.

[BibT_eX]

[DOI]

Teresa Krick

Juan Sabia

Appl. Algebra Eng. Commun. Comput., 1997

1995

Bounds for traces in complete intersections and degrees in the Nullstellensatz.

[BibT_eX]

[DOI]

Juan Sabia

Appl. Algebra Eng. Commun. Comput., 1995

On the Computation of the Radical of Polynomial Complete Intersection Ideals.

[BibT_eX]

[DOI]

Inés Armendáriz

Proceedings of the Applied Algebra, 1995

1994

Description of the Connected Components of a Semialgebraic in Single Exponential Time.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 1994

1993

On the Theoretical and Practical Complexity of the Existential Theory of Reals.

[BibT_eX]

[DOI]

Comput. J., 1993

(Working Group Noaï Fitchas) Algorithmic Aspects of Suslin's Proof of Serre's Conjecture.

[BibT_eX]

[DOI]

Comput. Complex., 1993

1991

Effective Lojasiewicz Inequalities in Semialgebraic Geometry.

[BibT_eX]

[DOI]

Appl. Algebra Eng. Commun. Comput., 1991

A Gemometrical Bound for Integer Programming with Polynomial Constraints.

[BibT_eX]

[DOI]

Proceedings of the Fundamentals of Computation Theory, 8th International Symposium, 1991

1990

Single Exponential Path Finding in Semialgebraic Sets. Part 1: The Case of a Regular Bounded Hypersurface.

[BibT_eX]

[DOI]

Proceedings of the Applied Algebra, 1990

Geometric Problems Solvable in Single Exponential Time.

[BibT_eX]

[DOI]

Proceedings of the Applied Algebra, 1990

1989

On the Complexity of Semialgebraic Sets.

[BibT_eX]