Publication | Date of Publication | Type |
---|
Counting roots for polynomials modulo prime powers | 2023-08-02 | Paper |
Computing zeta functions of large polynomial systems over finite fields | 2022-09-12 | Paper |
A complexity chasm for solving sparse polynomial equations over p -adic fields | 2022-09-06 | Paper |
Root repulsion and faster solving for very sparse polynomials over \(p\)-adic fields | 2022-08-25 | Paper |
Sturm's Theorem with Endpoints | 2022-08-16 | Paper |
Trinomials and Deterministic Complexity Limits for Real Solving | 2022-02-12 | Paper |
Correction to: ``Tropical varieties for exponential sums | 2021-08-27 | Paper |
Smoothed analysis for the condition number of structured real polynomial systems | 2021-07-07 | Paper |
Sub-Linear Point Counting for Variable Separated Curves over Prime Power Rings | 2021-02-02 | Paper |
Counting Real Roots in Polynomial-Time for Systems Supported on Circuits | 2020-12-09 | Paper |
A Faster Solution to Smale's 17th Problem I | 2020-09-10 | Paper |
Tropical varieties for exponential sums | 2020-08-06 | Paper |
Book Review: Kolmogorov complexity and algorithmic randomness | 2020-03-20 | Paper |
A complexity chasm for solving univariate sparse polynomial equations over $p$-adic fields | 2020-02-29 | Paper |
Randomized polynomial-time root counting in prime power rings | 2019-10-07 | Paper |
Probabilistic condition number estimates for real polynomial systems. I: A broader family of distributions | 2019-02-21 | Paper |
Metric estimates and membership complexity for Archimedean amoebae and tropical hypersurfaces | 2018-04-18 | Paper |
Dedekind Zeta Zeroes and Faster Complex Dimension Computation | 2018-03-11 | Paper |
New Subexponential Fewnomial Hypersurface Bounds | 2017-10-02 | Paper |
Sparse univariate polynomials with many roots over finite fields | 2017-07-13 | Paper |
Sub-linear root detection, and new hardness results, for sparse polynomials over finite fields | 2017-02-10 | Paper |
Optimization and NP_R-completeness of certain fewnomials | 2017-02-03 | Paper |
A-Discriminants for Complex Exponents, and Counting Real Isotopy Types | 2016-12-11 | Paper |
On the complexity of diophantine geometry in low dimensions (extended abstract) | 2016-09-29 | Paper |
Sublinear Root Detection and New Hardness Results for Sparse Polynomials over Finite Fields | 2016-08-26 | Paper |
Fewnomial systems with many roots, and an Adelic Tau Conjecture | 2015-09-07 | Paper |
Polynomial-Time Amoeba Neighborhood Membership and Faster Localized Solving | 2015-04-17 | Paper |
Book Review: Inevitable randomness in discrete mathematics | 2013-09-16 | Paper |
Counting Tropically Degenerate Valuations and p-adic Approaches to the Hardness of the Permanent | 2013-09-02 | Paper |
https://portal.mardi4nfdi.de/entity/Q4914763 | 2013-04-15 | Paper |
New Multiplier Sequences via Discriminant Amoebae | 2013-01-17 | Paper |
Faster real feasibility via circuit discriminants | 2012-05-13 | Paper |
Randomization, Sums of Squares, and Faster Real Root Counting for Tetranomials and Beyond | 2012-01-05 | Paper |
Optimizing \(n\)-variate \((n+k)\)-nomials for small \(k\) | 2011-03-29 | Paper |
Refined Asymptotics for Multigraded Sums of Squares | 2009-01-23 | Paper |
https://portal.mardi4nfdi.de/entity/Q5447548 | 2008-03-20 | Paper |
https://portal.mardi4nfdi.de/entity/Q5448347 | 2008-03-20 | Paper |
https://portal.mardi4nfdi.de/entity/Q5447281 | 2008-03-06 | Paper |
https://portal.mardi4nfdi.de/entity/Q5447351 | 2008-03-06 | Paper |
Algorithmic Arithmetic Fewnomial Theory I: One Variable | 2007-11-16 | Paper |
On solving univariate sparse polynomials in logarithmic time | 2005-02-22 | Paper |
https://portal.mardi4nfdi.de/entity/Q4737511 | 2004-08-11 | Paper |
High probability analysis of the condition number of sparse polynomial systems | 2004-08-06 | Paper |
Counting real connected components of trinomial curve intersections and \(m\)-nomial hypersurfaces | 2004-07-07 | Paper |
Arithmetic multivariate Descartes' rule | 2004-03-16 | Paper |
https://portal.mardi4nfdi.de/entity/Q4453667 | 2004-03-07 | Paper |
https://portal.mardi4nfdi.de/entity/Q4789199 | 2003-04-23 | Paper |
Some speed-ups and speed limits for real algebraic geometry | 2003-04-06 | Paper |
Dedekind Zeta Functions and the Complexity of Hilbert's Nullstellensatz | 2003-01-11 | Paper |
Computational arithmetic geometry. I: Sentences nearly in the polynomial hierarchy | 2002-07-15 | Paper |
An Improved Bound on the VC-Dimension of Neural Networks with Polynomial Activation Functions | 2001-12-19 | Paper |
https://portal.mardi4nfdi.de/entity/Q2715540 | 2001-07-26 | Paper |
On Solving Fewnomials Over Intervals in Fewnomial Time | 2001-06-26 | Paper |
https://portal.mardi4nfdi.de/entity/Q4329398 | 2001-01-01 | Paper |
Random Sparse Polynomial Systems | 2000-12-13 | Paper |
Solving degenerate sparse polynomial systems faster | 2000-08-21 | Paper |
Counting Isolated Roots of Trinomial Systems in the Plane and Beyond | 2000-08-09 | Paper |
Uncomputably large integral points on algebraic plane curves? | 2000-06-04 | Paper |
Computing Complex Dimension Faster and Deterministically | 2000-05-03 | Paper |
https://portal.mardi4nfdi.de/entity/Q4252029 | 2000-01-11 | Paper |
https://portal.mardi4nfdi.de/entity/Q4237376 | 1999-09-09 | Paper |
Counting affine roots of polynomial systems via pointed Newton polytopes | 1998-04-07 | Paper |
https://portal.mardi4nfdi.de/entity/Q4336116 | 1997-06-12 | Paper |
https://portal.mardi4nfdi.de/entity/Q4717961 | 1997-01-07 | Paper |
A convex geometric approach to counting the roots of a polynomial system | 1995-05-14 | Paper |