| Publication | Date of Publication | Type |
|---|
When can you trust feature selection? -- II: On the effects of random data on condition in statistics and optimisation
| 2023-12-18 | Paper |
Rigid continuation paths II. structured polynomial systems
Forum of Mathematics, Pi | 2023-06-02 | Paper |
Logics which capture complexity classes over the reals
Fundamentals of Computation Theory | 2022-12-09 | Paper |
Functional norms, condition numbers and numerical algorithms in algebraic geometry
Forum of Mathematics, Sigma | 2022-12-08 | Paper |
On the complexity of the Plantinga-Vegter algorithm
Discrete & Computational Geometry | 2022-09-16 | Paper |
Computing the homology of semialgebraic sets. II: General formulas
Foundations of Computational Mathematics | 2021-11-26 | Paper |
Smale 17th Problem: Advances and Open Directions
New Zealand Journal of Mathematics | 2021-09-28 | Paper |
Plantinga-Vegter algorithm takes average polynomial time
Proceedings of the 2019 on International Symposium on Symbolic and Algebraic Computation | 2020-09-10 | Paper |
Recent advances in the computation of the homology of semialgebraic sets
| 2020-05-12 | Paper |
On local analysis
Journal of Complexity | 2020-03-03 | Paper |
Computing the homology of semialgebraic sets. I: Lax formulas
Foundations of Computational Mathematics | 2020-01-31 | Paper |
On local analysis
| 2019-05-20 | Paper |
Computing the homology of real projective sets
Foundations of Computational Mathematics | 2019-03-01 | Paper |
Computing the homology of basic semialgebraic sets in weak exponential time
Journal of the ACM | 2019-02-25 | Paper |
On Flocks Under Switching Directed Interaction Topologies
SIAM Journal on Applied Mathematics | 2019-01-23 | Paper |
A stable, polynomial-time algorithm for the eigenpair problem
Journal of the European Mathematical Society (JEMS) | 2018-06-21 | Paper |
Grid methods in computational real algebraic (and semialgebraic) geometry
Chinese Annals of Mathematics. Series B | 2018-05-31 | Paper |
On the condition of the zeros of characteristic polynomials
Journal of Complexity | 2017-09-07 | Paper |
A General Collision-Avoiding Flocking Framework
IEEE Transactions on Automatic Control | 2017-08-25 | Paper |
Avoiding Collisions in Flocks
IEEE Transactions on Automatic Control | 2017-08-25 | Paper |
Emergent Behavior in Flocks
IEEE Transactions on Automatic Control | 2017-07-27 | Paper |
On flocks influenced by closest neighbors
M\(^3\)AS. Mathematical Models & Methods in Applied Sciences | 2017-02-02 | Paper |
Condition length and complexity for the solution of polynomial systems
Foundations of Computational Mathematics | 2017-02-01 | Paper |
Probabilistic analyses of condition numbers
Acta Numerica | 2016-07-08 | Paper |
Complexity and dimension
Information Processing Letters | 2016-05-26 | Paper |
A randomized homotopy for the Hermitian eigenpair problem
Foundations of Computational Mathematics | 2015-04-20 | Paper |
Solving second-order conic systems with variable precision
Mathematical Programming. Series A. Series B | 2015-04-16 | Paper |
A theory of complexity, condition, and roundoff
Forum of Mathematics, Sigma | 2015-03-11 | Paper |
Smoothed analysis of componentwise condition numbers for sparse matrices
IMA Journal of Numerical Analysis | 2015-02-17 | Paper |
A stable, polynomial-time algorithm for the eigenpair problem
| 2014-10-01 | Paper |
Solving polynomial equations in smoothed polynomial time and a near solution to Smale's 17th problem
Proceedings of the forty-second ACM symposium on Theory of computing | 2014-08-13 | Paper |
Fast computation of zeros of polynomial systems with bounded degree under finite-precision
Mathematics of Computation | 2014-03-12 | Paper |
A conditional, collision-avoiding, model for swarming
Discrete and Continuous Dynamical Systems | 2013-11-11 | Paper |
On the average condition of random linear programs
SIAM Journal on Optimization | 2013-09-25 | Paper |
Condition. The geometry of numerical algorithms
Grundlehren der Mathematischen Wissenschaften | 2013-07-05 | Paper |
scientific article; zbMATH DE number 6174859 (Why is no real title available?)
| 2013-06-12 | Paper |
On sparseness and Turing reducibility over the reals
Electronic Notes in Theoretical Computer Science | 2013-04-19 | Paper |
Safe recursion over an arbitrary structure: PAR, PH and DPH
Electronic Notes in Theoretical Computer Science | 2013-04-19 | Paper |
Manifold Mirrors
| 2013-04-08 | Paper |
Round-off estimates for second-order conic feasibility problems
Comptes Rendus. Mathématique. Académie des Sciences, Paris | 2012-08-30 | Paper |
The Legacy of Turing in Numerical Analysis
SOFSEM 2012: Theory and Practice of Computer Science | 2012-06-15 | Paper |
On a problem posed by Steve Smale
Annals of Mathematics. Second Series | 2012-02-11 | Paper |
A numerical algorithm for zero counting. III: Randomization and condition
Advances in Applied Mathematics | 2011-12-08 | Paper |
Solving Linear Problems with Finite Precision III: Sharp Expectation Bounds
| 2011-05-11 | Paper |
A numerical algorithm for zero counting. II: Distance to ill-posedness and smoothed analysis
Journal of Fixed Point Theory and Applications | 2011-04-13 | Paper |
Smoothed Analysis of Moore–Penrose Inversion
SIAM Journal on Matrix Analysis and Applications | 2011-03-02 | Paper |
Parallel time and quantifier prefixes
Computational Complexity | 2011-02-18 | Paper |
Counting complexity classes for numeric computations II
Proceedings of the thirty-sixth annual ACM symposium on Theory of computing | 2010-08-15 | Paper |
The probability that a slightly perturbed numerical analysis problem is difficult
Mathematics of Computation | 2010-08-03 | Paper |
Adversarial smoothed analysis
Journal of Complexity | 2010-08-03 | Paper |
Componentwise Condition Numbers of Random Sparse Matrices
SIAM Journal on Matrix Analysis and Applications | 2010-05-25 | Paper |
Coverage processes on spheres and condition numbers for linear programming
The Annals of Probability | 2010-04-21 | Paper |
On strata of degenerate polyhedral cones. II: Relations between condition measures
Journal of Complexity | 2010-04-21 | Paper |
ON THE CRITICAL EXPONENT FOR FLOCKS UNDER HIERARCHICAL LEADERSHIP
M\(^3\)AS. Mathematical Models & Methods in Applied Sciences | 2009-10-28 | Paper |
Algorithms and Computation
Lecture Notes in Computer Science | 2009-08-07 | Paper |
On strata of degenerate polyhedral cones. I: Condition and distance to strata
European Journal of Operational Research | 2009-06-30 | Paper |
Exotic quantifiers, complexity classes, and complete problems
Foundations of Computational Mathematics | 2009-06-22 | Paper |
Flocking with informed agents
MathematicS In Action | 2009-05-29 | Paper |
A Condition Number for Multifold Conic Systems
SIAM Journal on Optimization | 2009-03-06 | Paper |
On the mathematics of emergence
Japanese Journal of Mathematics. 3rd Series | 2009-02-06 | Paper |
A numerical algorithm for zero counting II: Randomization and Condition
| 2008-12-17 | Paper |
A numerical algorithm for zero counting. I: Complexity and accuracy
Journal of Complexity | 2008-12-03 | Paper |
Flocking in noisy environments
Journal de Mathématiques Pures et Appliquées. Neuvième Série | 2008-04-10 | Paper |
A note on parallel and alternating time
Journal of Complexity | 2008-01-09 | Paper |
Exotic Quantifiers, Complexity Classes, and Complete Problems
Automata, Languages and Programming | 2007-11-28 | Paper |
Mixed and componentwise condition numbers for rectangular structured matrices
Calcolo | 2007-11-26 | Paper |
Learning Theory
| 2007-03-13 | Paper |
On mixed and componentwise condition numbers for Moore–Penrose inverse and linear least squares problems
Mathematics of Computation | 2007-03-07 | Paper |
Smoothed analysis of complex conic condition numbers
Journal de Mathématiques Pures et Appliquées. Neuvième Série | 2007-02-13 | Paper |
The complexity of semilinear problems in succinct representation
Computational Complexity | 2007-01-24 | Paper |
Smoothed analysis of some condition numbers
Numerical Linear Algebra with Applications | 2006-12-06 | Paper |
Fundamentals of Computation Theory
Lecture Notes in Computer Science | 2006-10-20 | Paper |
Counting complexity classes for numeric computations. III: Complex projective sets
Foundations of Computational Mathematics | 2006-09-28 | Paper |
General formulas for the smoothed analysis of condition numbers
Comptes Rendus. Mathématique. Académie des Sciences, Paris | 2006-08-14 | Paper |
Solving linear programs with finite precision. II: Algorithms
Journal of Complexity | 2006-07-12 | Paper |
Counting complexity classes for numeric computations. II: Algebraic and semialgebraic sets
Journal of Complexity | 2006-05-16 | Paper |
Implicit complexity over an arbitrary structure: Quantifier alternations
Information and Computation | 2006-04-28 | Paper |
Unifying Condition Numbers for Linear Programming
Mathematics of Operations Research | 2005-11-11 | Paper |
Tail Decay and Moment Estimates of a Condition Number for Random Linear Conic Systems
SIAM Journal on Optimization | 2005-09-16 | Paper |
scientific article; zbMATH DE number 2196510 (Why is no real title available?)
| 2005-08-22 | Paper |
A note on level-2 condition numbers
Journal of Complexity | 2005-06-30 | Paper |
On sparseness, reducibilities, and complexity
Annals of Pure and Applied Logic | 2005-06-01 | Paper |
Implicit Complexity over an Arbitrary Structure: Sequential and Parallel Polynomial Time
Journal Of Logic And Computation | 2005-04-29 | Paper |
scientific article; zbMATH DE number 2163035 (Why is no real title available?)
| 2005-04-29 | Paper |
Modeling language evolution
Foundations of Computational Mathematics | 2005-03-11 | Paper |
Complexity estimates depending on condition and round-off error
Journal of the ACM | 2005-01-25 | Paper |
The complexity to compute the Euler characteristic of complex varieties
Comptes Rendus. Mathématique. Académie des Sciences, Paris | 2004-11-23 | Paper |
scientific article; zbMATH DE number 2109417 (Why is no real title available?)
| 2004-10-25 | Paper |
scientific article; zbMATH DE number 2063216 (Why is no real title available?)
| 2004-03-29 | Paper |
Solving linear programs with finite precision. I: Condition numbers and random programs
Mathematical Programming. Series A. Series B | 2004-03-11 | Paper |
Counting Complexity Classes for Numeric Computations I: Semilinear Sets
SIAM Journal on Computing | 2004-01-08 | Paper |
On the expected condition number of linear programming problems
Numerische Mathematik | 2003-08-19 | Paper |
scientific article; zbMATH DE number 1956513 (Why is no real title available?)
| 2003-07-30 | Paper |
Learning from rounded-off data.
Information and Computation | 2003-05-27 | Paper |
Real computations with fake numbers
Journal of Complexity | 2003-02-16 | Paper |
scientific article; zbMATH DE number 1834655 (Why is no real title available?)
| 2002-11-25 | Paper |
Probabilistic analysis of condition numbers for linear programming
Journal of Optimization Theory and Applications | 2002-10-08 | Paper |
Three lectures on real computation
| 2002-06-30 | Paper |
A primal-dual algorithm for solving polyhedral conic systems with a finite-precision machine
SIAM Journal on Optimization | 2002-04-23 | Paper |
There are no sparse NP\(_{w}\)-hard sets
SIAM Journal on Computing | 2002-04-23 | Paper |
Decision problems and round-off machines
Theory of Computing Systems | 2002-02-28 | Paper |
Best choices for regularization parameters in learning theory: on the bias-variance problem.
Foundations of Computational Mathematics | 2002-01-01 | Paper |
scientific article; zbMATH DE number 1859208 (Why is no real title available?)
| 2002-01-01 | Paper |
On the mathematical foundations of learning
Bulletin of the American Mathematical Society. New Series | 2001-12-17 | Paper |
On weak and weighted computations over the real closure of \(\mathbb{Q}\)
Theoretical Computer Science | 2001-08-23 | Paper |
A new condition number for linear programming
Mathematical Programming. Series A. Series B | 2001-01-01 | Paper |
scientific article; zbMATH DE number 1405639 (Why is no real title available?)
| 2000-09-20 | Paper |
Complexity lower bounds for approximation algebraic computation trees
Journal of Complexity | 2000-09-03 | Paper |
Approximate zeros and condition numbers
Journal of Complexity | 2000-05-07 | Paper |
scientific article; zbMATH DE number 1305086 (Why is no real title available?)
| 2000-01-11 | Paper |
scientific article; zbMATH DE number 1354146 (Why is no real title available?)
| 1999-10-31 | Paper |
scientific article; zbMATH DE number 1263209 (Why is no real title available?)
| 1999-06-29 | Paper |
Logics which capture complexity classes over the reals
Journal of Symbolic Logic | 1999-06-29 | Paper |
A polynomial time algorithm for diophantine equations in one variable
Journal of Symbolic Computation | 1999-06-20 | Paper |
scientific article; zbMATH DE number 1257074 (Why is no real title available?)
| 1999-03-01 | Paper |
scientific article; zbMATH DE number 1096865 (Why is no real title available?)
| 1997-12-14 | Paper |
On the Power of Real Turing Machines over Binary Inputs
SIAM Journal on Computing | 1997-11-10 | Paper |
On digital nondeterminism
Mathematical Systems Theory | 1997-08-17 | Paper |
COMPLEXITY AND REAL COMPUTATION: A MANIFESTO
International Journal of Bifurcation and Chaos in Applied Sciences and Engineering | 1997-07-17 | Paper |
Machines Over the Reals and Non-Uniformity
Mathematical Logic Quarterly | 1997-05-14 | Paper |
scientific article; zbMATH DE number 953015 (Why is no real title available?)
| 1997-03-31 | Paper |
Generalized Knapsack problems and fixed degree separations
Theoretical Computer Science | 1997-02-27 | Paper |
scientific article; zbMATH DE number 953010 (Why is no real title available?)
| 1997-02-03 | Paper |
Computing over the reals with addition and order: Higher complexity classes
Journal of Complexity | 1996-05-05 | Paper |
Separation of complexity classes in Koiran's weak model
Theoretical Computer Science | 1994-11-27 | Paper |
On the Complexity of Quantifier Elimination: the Structural Approach
The Computer Journal | 1993-11-28 | Paper |
scientific article; zbMATH DE number 176763 (Why is no real title available?)
| 1993-05-18 | Paper |
TIME BOUNDED COMPUTATIONS OVER THE REALS
International Journal of Algebra and Computation | 1993-03-28 | Paper |
Two \(P\)-complete problems in the theory of the reals
Journal of Complexity | 1993-02-22 | Paper |
\(P_ \mathbb{R}{}\neq{}NC_ \mathbb{R}\)
Journal of Complexity | 1993-01-17 | Paper |
The Arithmetical Hierarchy Over the Reals
Journal Of Logic And Computation | 1993-01-16 | Paper |
scientific article; zbMATH DE number 1975376 (Why is no real title available?)
| 1993-01-01 | Paper |
scientific article; zbMATH DE number 16645 (Why is no real title available?)
| 1992-06-26 | Paper |
A theorem on random polynomials and some consequences in average complexity
Journal of Symbolic Computation | 1990-01-01 | Paper |
scientific article; zbMATH DE number 4189909 (Why is no real title available?)
| 1990-01-01 | Paper |
An Alternate Proof of the Continuity of the Roots of a Polynomial
The American Mathematical Monthly | 1989-01-01 | Paper |
Nash functions over real spectra
Journal of Pure and Applied Algebra | 1989-01-01 | Paper |
Nash functions and the structure sheaf
Rocky Mountain Journal of Mathematics | 1989-01-01 | Paper |
Non recursive functions have transcendental generating series
RAIRO - Theoretical Informatics and Applications | 1989-01-01 | Paper |
Functions de Nash sur les variétés affines. (Nash functions on affine varieties)
Mathematische Zeitschrift | 1988-01-01 | Paper |
Sur les anneaux de sections globales du faisceau structural sur le spectre reel
Communications in Algebra | 1988-01-01 | Paper |
scientific article; zbMATH DE number 4000105 (Why is no real title available?)
| 1987-01-01 | Paper |
scientific article; zbMATH DE number 3977148 (Why is no real title available?)
| 1986-01-01 | Paper |
scientific article; zbMATH DE number 4089701 (Why is no real title available?)
| 1986-01-01 | Paper |
