| Publication | Date of Publication | Type |
|---|
| An unfeasibility view of neural network learning | 2023-02-17 | Paper |
| Intrinsic complexity for constructing zero-dimensional Gröbner bases | 2022-12-21 | Paper |
| On Bézout inequalities for non-homogeneous polynomial ideals | 2021-06-03 | Paper |
| Quiz games as a model for information hiding | 2016-04-20 | Paper |
| On the intrinsic complexity of elimination problems in effective algebraic geometry | 2015-08-04 | Paper |
| Polar, bipolar and copolar varieties: Real solving of algebraic varieties with intrinsic complexity | 2015-08-04 | Paper |
| Degeneracy loci and polynomial equation solving | 2015-04-20 | Paper |
| Intrinsic complexity estimates in polynomial optimization | 2014-07-15 | Paper |
| Point searching in real singularcomplete intersection varieties: algorithms of intrinsic complexity | 2014-01-22 | Paper |
| Efficient evaluation of specific queries in constraint databases | 2013-04-04 | Paper |
| Software engineering and complexity in effective algebraic geometry | 2013-01-14 | Paper |
| Evaluating geometric queries using few arithmetic operations | 2012-12-13 | Paper |
| Algorithms of intrinsic complexity for point searching in compact real singular hypersurfaces | 2012-07-03 | Paper |
| Bipolar varieties and real solving of a singular polynomial equation | 2012-07-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5389777 | 2012-04-23 | Paper |
| Lower complexity bounds for interpolation algorithms | 2011-04-13 | Paper |
| On the intrinsic complexity of point finding in real singular hypersurfaces | 2010-09-01 | Paper |
| On the geometry of polar varieties | 2010-03-01 | Paper |
| Constraint Databases | 2006-01-10 | Paper |
| Generalized polar varieties: geometry and algorithms | 2005-09-02 | Paper |
| Kronecker's smart, little black boxes | 2002-02-07 | Paper |
| On the time-space complexity of geometric elimination procedures | 2001-07-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4524451 | 2001-07-03 | Paper |
| Polar varieties and efficient real elimination | 2001-01-01 | Paper |
| Straight-line programs in geometric elimination theory | 2000-05-29 | Paper |
| Deformation techniques for efficient polynomial equation solving. | 2000-01-01 | Paper |
| Time-space tradeoffs in algebraic complexity theory | 2000-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4295432 | 1999-09-30 | Paper |
| Le rapport entre le temps et l'espace pour l'évaluation des polynômes | 1999-06-20 | Paper |
| The intrinsic complexity of parametric elimination methods | 1999-03-18 | Paper |
| Polar Varieties and Efficient Real Equation Solving: The Hypersurface Case | 1999-03-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4218097 | 1999-03-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4352797 | 1998-12-07 | Paper |
| Le rôle des structures de données dans les problèmes d'élimination | 1998-04-20 | Paper |
| Polar varieties, real equation solving, and data structures: the hypersurface case | 1997-07-28 | Paper |
| Lower bounds for diophantine approximations | 1997-06-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4850731 | 1996-01-22 | Paper |
| On the intrinsic complexity of elimination theory | 1994-08-17 | Paper |
| Description of the connected components of a semialgebraic set in single exponential time | 1994-04-21 | Paper |
| Une borne optimale pour la programmation entière quasi-convexe | 1993-10-20 | Paper |
| Algorithmic aspects of Suslin's proof of Serre's conjecture | 1993-08-30 | Paper |
| On the efficiency of effective Nullstellensätze | 1993-08-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4026986 | 1993-02-21 | Paper |
| On the Theoretical and Practical Complexity of the Existential Theory of Reals | 1993-01-01 | Paper |
| Search for shortest path around semialgebraic obstacles in the plane | 1992-09-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4011313 | 1992-09-27 | Paper |
| Equations for the projective closure and effective Nullstellensatz | 1992-06-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3983701 | 1992-06-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3973337 | 1992-06-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3975179 | 1992-06-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3975182 | 1992-06-26 | Paper |
| Sur la complexité du principe de Tarski-Seidenberg | 1992-06-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3971133 | 1992-06-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3362376 | 1991-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3035143 | 1990-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3835021 | 1989-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3483265 | 1989-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4203817 | 1989-01-01 | Paper |
| Real quantifier elimination is doubly exponential | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4204240 | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4725743 | 1986-01-01 | Paper |
| On polynomials with symmetric Galois group which are easy to compute | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3735893 | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3717026 | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3756516 | 1985-01-01 | Paper |
| Definability and fast quantifier elimination in algebraically closed fields | 1983-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3316589 | 1983-01-01 | Paper |
| Commutative algebras of minimal rank | 1983-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3942397 | 1982-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3912021 | 1981-01-01 | Paper |
| Lower bounds for polynomials with algebraic coefficients | 1980-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3880806 | 1979-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4194460 | 1979-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4110999 | 1976-01-01 | Paper |
