Joos Heintz

Luis Miguel Pardo

Enrique Carlos Segura

Hvara Ocar

Andres Rojas Paredes

J. Complex., April, 2023

2022

An unfeasability view of neural network learning.

[BibT_eX]

[DOI]

Enrique Carlos Segura

CoRR, 2022

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

Quiz games as a model for information hiding.

[BibT_eX]

[DOI]

J. Complex., 2016

2015

Degeneracy Loci and Polynomial Equation Solving.

[BibT_eX]

[DOI]

Found. Comput. Math., 2015

2014

Point searching in real singularcomplete intersection varieties: algorithms of intrinsic complexity.

[BibT_eX]

[DOI]

Bernd Bank

Marc Giusti

Math. Comput., 2014

Intrinsic complexity estimates in polynomial optimization.

[BibT_eX]

[DOI]

J. Complex., 2014

2013

Software Engineering and complexity in effective Algebraic Geometry.

[BibT_eX]

[DOI]

Andres Rojas Paredes

J. Complex., 2013

2012

Algorithms of Intrinsic Complexity for Point Searching in Compact Real Singular Hypersurfaces.

[BibT_eX]

[DOI]

Found. Comput. Math., 2012

On the intrinsic complexity of elimination problems in effective Algebraic Geometry

[BibT_eX]

[DOI]

Andres Rojas Paredes

CoRR, 2012

Evaluating geometric queries using few arithmetic operations.

[BibT_eX]

[DOI]

Rafael Grimson

Appl. Algebra Eng. Commun. Comput., 2012

2011

Lower complexity bounds for interpolation algorithms.

[BibT_eX]

[DOI]

J. Complex., 2011

Efficient evaluation of specific queries in constraint databases.

[BibT_eX]

[DOI]

Rafael Grimson

Inf. Process. Lett., 2011

The evaluation of geometric queries: constraint databases and quantifier elimination

[BibT_eX]

[DOI]

Marc Giusti

CoRR, 2011

2010

On the geometry of polar varieties.

[BibT_eX]

[DOI]

Appl. Algebra Eng. Commun. Comput., 2010

2009

On the intrinsic complexity of point finding in real singular hypersurfaces.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2009

2007

07212 Manifesto -- Constraint Databases, Geometric Elimination ang Geographic Information Systems.

[BibT_eX]

[DOI]

Proceedings of the Constraint Databases, Geometric Elimination and Geographic Information Systems, 20.05., 2007

2005

Generalized polar varieties: geometry and algorithms.

[BibT_eX]

[DOI]

J. Complex., 2005

2004

Generalized polar varieties and an efficient real elimination.

[BibT_eX]

[DOI]

Kybernetika, 2004

Constraint Databases, Data Structures and Efficient Query Evaluation.

[BibT_eX]

[DOI]

Proceedings of the Constraint Databases, 2004

2003

The Hardness of Polynomial Equation Solving.

[BibT_eX]

[DOI]

Found. Comput. Math., 2003

2002

Functional programming concepts and straight-line programs in computer algebra.

[BibT_eX]

[DOI]

Math. Comput. Simul., 2002

2001

On the Time-Space Complexity of Geometric Elimination Procedures.

[BibT_eX]

[DOI]

Guillermo Matera

Ariel Waissbein

Appl. Algebra Eng. Commun. Comput., 2001

2000

Deformation Techniques for Efficient Polynomial Equation Solving.

[BibT_eX]

[DOI]

J. Complex., 2000

Time-Space Tradeoffs in Algebraic Complexity Theory.

[BibT_eX]

[DOI]

J. Complex., 2000

1999

OpTERA - Optimization and Real Equation Solving.

[BibT_eX]

Proceedings of the German-Argentinian Workshop on Information Technology, 1999

1998

Combinatorial Hardness Proofs for Polynomial Evaluation.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 1998, 1998

1997

Polar Varieties, Real Equation Solving, and Data Structures: The Hypersurface Case.

[BibT_eX]

[DOI]

J. Complex., 1997

1995

When Polynomial Equation Systems Can Be "Solved" Fast?.

[BibT_eX]

[DOI]

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 Intrinsic Complexity of Elimination Theory.

[BibT_eX]

[DOI]

Jacques Morgenstern

J. Complex., 1993

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

[BibT_eX]

[DOI]

Comput. J., 1993

On the Efficiency of Effective Nullstellensätze.

[BibT_eX]

[DOI]

Marc Giusti

Juan Sabia

Comput. Complex., 1993

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

[BibT_eX]

[DOI]

Comput. Complex., 1993

1991

Equations for the projective closure and effective Nullstellensatz.

[BibT_eX]

[DOI]

Leandro Caniglia

André Galligo

Discret. Appl. Math., 1991

1990

Algorithms in Real Algebraic Geometry and Applications to Computational Geometry.

[BibT_eX]

[DOI]

Tomás Recio

Proceedings of the Discrete and Computational Geometry: Papers from the DIMACS Special Year, 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]

Proceedings of the Information Processing 89, Proceedings of the IFIP 11th World Computer Congress, San Francisco, USA, August 28, 1989

1988

Real Quantifier Elimination is Doubly Exponential.

[BibT_eX]

[DOI]

James H. Davenport

J. Symb. Comput., 1988

Some New Effectivity Bounds in Computational Geometry.

[BibT_eX]

[DOI]

Leandro Caniglia

André Galligo

Proceedings of the Applied Algebra, 1988

1987

On the Complexity of Lie Algebras.

[BibT_eX]

[DOI]

Proceedings of the Fundamentals of Computation Theory, 1987

On the Computational Complexity of Polynomials and Bilinear Mappings. A Survey.

[BibT_eX]

[DOI]

Proceedings of the Applied Algebra, 1987

1986

On Polynomials with Symmetric Galois Group which Are Easy to Compute.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1986

1985

Corrigendum: Definability and Fast Quantifier Elimination in Algebraically Closed Fields.

[BibT_eX]

Theor. Comput. Sci., 1985

A Lower Bound for the Bilinear Complexity of Some Semisimple Lie Algebras.

[BibT_eX]

[DOI]

Hans F. de Groote

Proceedings of the Algebraic Algorithms and Error-Correcting Codes, 1985

1984

On associative algebras of minimal rank.

[BibT_eX]

[DOI]

Jacques Morgenstern

Proceedings of the Applied Algebra, 1984

1983

Definability and Fast Quantifier Elimination in Algebraically Closed Fields.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1983

1981

Absolute Primality of Polynomials is Decidable in Random Polynomial Time in the Number of Variables.

[BibT_eX]

[DOI]

Malte Sieveking

Proceedings of the Automata, 1981

1980

Lower Bounds for Polynomials with Algebraic Coefficients.

[BibT_eX]

[DOI]

Malte Sieveking

Theor. Comput. Sci., 1980

Testing Polynomials which Are Easy to Compute (Extended Abstract)

[BibT_eX]

[DOI]

Claus-Peter Schnorr

Proceedings of the 12th Annual ACM Symposium on Theory of Computing, 1980

1979

A New Method to Show Lower Bounds for Polynomials which are Hard to Compute.

[BibT_eX]

[DOI]

Proceedings of the Theoretical Computer Science, 1979

1976

Untere Schranken für die Komplexität logischer Entscheidungsprobleme.

[BibT_eX]

[DOI]

Proceedings of the Komplexität von Entscheidungsproblemen, Ein Seminar, 1976

1975

An efficient quantifier elimination algorithm for algebraically closed fields of any characteristic.

[BibT_eX]

[DOI]