| Publication | Date of Publication | Type |
|---|
On the hardness of PosSLP
| 2024-11-28 | Paper |
Real zeros of mixed random fewnomial systems
Proceedings of the 2023 International Symposium on Symbolic and Algebraic Computation | 2023-11-03 | Paper |
scientific article; zbMATH DE number 7711614 (Why is no real title available?)
| 2023-07-12 | Paper |
Rigid continuation paths II. structured polynomial systems
Forum of Mathematics, Pi | 2023-06-02 | Paper |
Nonarchimedean integral geometry
| 2022-06-08 | Paper |
The zonoid algebra, generalized mixed volumes, and random determinants
Advances in Mathematics | 2022-05-11 | Paper |
Computing the homology of semialgebraic sets. II: General formulas
Foundations of Computational Mathematics | 2021-11-26 | Paper |
Correction to: ``The complexity of factors of multivariate polynomials
Foundations of Computational Mathematics | 2021-01-06 | Paper |
The real tau-conjecture is true on average
Random Structures & Algorithms | 2020-11-30 | Paper |
Probabilistic Schubert calculus
Journal für die Reine und Angewandte Mathematik | 2020-03-02 | Paper |
Computing the homology of semialgebraic sets. I: Lax formulas
Foundations of Computational Mathematics | 2020-01-31 | Paper |
On the number of real zeros of random fewnomials
SIAM Journal on Applied Algebra and Geometry | 2020-01-22 | Paper |
Computing the homology of basic semialgebraic sets in weak exponential time
Journal of the ACM | 2019-02-25 | Paper |
No occurrence obstructions in geometric complexity theory
Journal of the American Mathematical Society | 2018-10-25 | Paper |
The complexity of computing Kronecker coefficients
| 2018-08-29 | Paper |
A max-flow algorithm for positivity of Littlewood-Richardson coefficients
| 2018-07-23 | Paper |
A stable, polynomial-time algorithm for the eigenpair problem
Journal of the European Mathematical Society (JEMS) | 2018-06-21 | Paper |
Efficient algorithms for tensor scaling, quantum marginals and moment polytopes
| 2018-04-12 | Paper |
On the condition of the zeros of characteristic polynomials
Journal of Complexity | 2017-09-07 | Paper |
Membership in moment polytopes is in NP and coNP
SIAM Journal on Computing | 2017-06-28 | Paper |
Condition of intersecting a projective variety with a varying linear subspace
SIAM Journal on Applied Algebra and Geometry | 2017-05-23 | Paper |
Fundamental invariants of orbit closures
Journal of Algebra | 2017-03-16 | Paper |
Condition length and complexity for the solution of polynomial systems
Foundations of Computational Mathematics | 2017-02-01 | Paper |
Permanent versus determinant: not via saturations
Proceedings of the American Mathematical Society | 2016-12-29 | Paper |
Permanent versus determinant, obstructions, and Kronecker coefficients
Séminaire Lotharingien de Combinatoire | 2016-07-11 | Paper |
Computing the Chow variety of quadratic space curves
Mathematical Aspects of Computer and Information Sciences | 2016-05-25 | Paper |
Distribution of the eigenvalues of a random system of homogeneous polynomials
Linear Algebra and its Applications | 2016-03-08 | Paper |
Probabilistic analysis of the Grassmann condition number
Foundations of Computational Mathematics | 2015-04-20 | Paper |
Intrinsic volumes of symmetric cones and applications in convex programming
Mathematical Programming. Series A. Series B | 2015-02-09 | 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 |
Explicit lower bounds via geometric complexity theory
Proceedings of the forty-eighth annual ACM symposium on Theory of Computing | 2014-08-07 | Paper |
Geometric complexity theory and tensor rank
Proceedings of the forty-third annual ACM symposium on Theory of computing | 2014-06-05 | Paper |
Deciding positivity of Littlewood-Richardson coefficients
SIAM Journal on Discrete Mathematics | 2014-04-10 | Paper |
Condition. The geometry of numerical algorithms
Grundlehren der Mathematischen Wissenschaften | 2013-07-05 | Paper |
A coordinate-free condition number for convex programming
SIAM Journal on Optimization | 2013-01-04 | Paper |
Intrinsic volumes of symmetric cones
| 2012-05-08 | Paper |
Robust smoothed analysis of a condition number for linear programming
Mathematical Programming. Series A. Series B | 2012-02-22 | Paper |
On a problem posed by Steve Smale
Annals of Mathematics. Second Series | 2012-02-11 | Paper |
Mathematical aspects of computer science smoothed analysis of condition numbers
| 2011-11-11 | Paper |
An overview of mathematical issues arising in the geometric complexity theory approach to \(\mathbf{VP}\neq\mathbf{VNP}\)
SIAM Journal on Computing | 2011-11-07 | Paper |
Nonvanishing of Kronecker coefficients for rectangular shapes.
Advances in Mathematics | 2011-07-07 | Paper |
Even partitions in plethysms.
Journal of Algebra | 2011-05-16 | Paper |
Smoothed Analysis of Moore–Penrose Inversion
SIAM Journal on Matrix Analysis and Applications | 2011-03-02 | Paper |
On defining integers and proving arithmetic circuit lower bounds
Computational Complexity | 2011-02-18 | Paper |
Counting irreducible components of complex algebraic varieties
Computational Complexity | 2011-02-07 | Paper |
Lower bounds on the bounded coefficient complexity of bilinear maps
Journal of the ACM | 2010-08-17 | 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 |
Coverage processes on spheres and condition numbers for linear programming
The Annals of Probability | 2010-04-21 | Paper |
On the Complexity of Numerical Analysis
SIAM Journal on Computing | 2009-11-06 | Paper |
Smoothed analysis of condition numbers
| 2009-10-26 | Paper |
Algorithms and Computation
Lecture Notes in Computer Science | 2009-08-07 | Paper |
On the complexity of counting components of algebraic varieties
Journal of Symbolic Computation | 2009-07-01 | Paper |
Exotic quantifiers, complexity classes, and complete problems
Foundations of Computational Mathematics | 2009-06-22 | Paper |
scientific article; zbMATH DE number 5494023 (Why is no real title available?)
| 2009-01-20 | Paper |
Average Euler characteristic of random real algebraic varieties
Comptes Rendus. Mathématique. Académie des Sciences, Paris | 2007-12-12 | Paper |
Exotic Quantifiers, Complexity Classes, and Complete Problems
Automata, Languages and Programming | 2007-11-28 | Paper |
On Defining Integers in the Counting Hierarchy and Proving Arithmetic Circuit Lower Bounds
STACS 2007 | 2007-09-03 | Paper |
The complexity of computing the Hilbert polynomial of smooth equidimensional complex projective varieties
Foundations of Computational Mathematics | 2007-03-12 | 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 |
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 |
Counting complexity classes for numeric computations. II: Algebraic and semialgebraic sets
Journal of Complexity | 2006-05-16 | Paper |
scientific article; zbMATH DE number 2196510 (Why is no real title available?)
| 2005-08-22 | Paper |
The complexity of factors of multivariate polynomials
Foundations of Computational Mathematics | 2005-02-24 | Paper |
The complexity to compute the Euler characteristic of complex varieties
Comptes Rendus. Mathématique. Académie des Sciences, Paris | 2004-11-23 | Paper |
Counting Complexity Classes for Numeric Computations I: Semilinear Sets
SIAM Journal on Computing | 2004-01-08 | Paper |
scientific article; zbMATH DE number 1984321 (Why is no real title available?)
| 2003-09-22 | Paper |
scientific article; zbMATH DE number 1834636 (Why is no real title available?)
| 2002-11-25 | Paper |
The Computational Complexity of Immanants
SIAM Journal on Computing | 2000-10-18 | Paper |
The Computational Complexity to Evaluate Representations of General Linear Groups
SIAM Journal on Computing | 2000-10-18 | Paper |
Completeness and reduction in algebraic complexity theory
Algorithms and Computation in Mathematics | 2000-06-14 | Paper |
Cook's versus Valiant's hypothesis
Theoretical Computer Science | 2000-06-04 | Paper |
scientific article; zbMATH DE number 1375589 (Why is no real title available?)
| 1999-12-09 | Paper |
On the parallel complexity of the polynomial ideal membership problem
Journal of Complexity | 1998-11-11 | Paper |
scientific article; zbMATH DE number 1136078 (Why is no real title available?)
| 1998-08-30 | Paper |
Algebraic complexity theory. I: An introduction
Séminaire Lotharingien de Combinatoire | 1998-03-12 | Paper |
Algebraic complexity theory. II: Tast matrix multiplication and combinatorics.
Séminaire Lotharingien de Combinatoire | 1998-03-12 | Paper |
scientific article; zbMATH DE number 976329 (Why is no real title available?)
| 1997-02-05 | Paper |
Some computational problems in linear algebra as hard as matrix multiplication
Computational Complexity | 1993-10-10 | Paper |
On randomized semi-algebraic test complexity
Journal of Complexity | 1993-08-24 | Paper |
Verification complexity of linear prime ideals
Journal of Pure and Applied Algebra | 1993-04-01 | Paper |
Test complexity of generic polynomials
Journal of Complexity | 1993-01-17 | Paper |
scientific article; zbMATH DE number 48553 (Why is no real title available?)
| 1992-09-17 | Paper |
