| Publication | Date of Publication | Type |
|---|
| Complete decomposition of symmetric tensors in linear time and polylogarithmic precision | 2023-10-04 | Paper |
| Absolute reconstruction for sums of powers of linear forms: degree 3 and beyond | 2023-08-16 | Paper |
| Derandomization and absolute reconstruction for sums of powers of linear forms | 2021-09-27 | Paper |
| Orthogonal tensor decomposition and orbit closures from a linear algebraic perspective | 2021-09-13 | Paper |
| Computing the multilinear factors of lacunary polynomials without heights | 2021-02-18 | Paper |
| Reconstruction algorithms for sums of affine powers | 2020-09-09 | Paper |
| Polynomial Equivalence Problems for Sum of Affine Powers | 2020-09-09 | Paper |
| On tensor rank and commuting matrices | 2020-06-03 | Paper |
| Intersection multiplicity of a sparse curve and a low-degree curve | 2020-02-24 | Paper |
| Reconstruction algorithms for sums of affine powers | 2020-01-15 | Paper |
| Root separation for trinomials | 2019-06-28 | Paper |
| Orbits of monomials and factorization into products of linear forms | 2018-07-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4636636 | 2018-04-19 | Paper |
| On the linear independence of shifted powers | 2018-03-12 | Paper |
| Hidden Cliques and the Certification of the Restricted Isometry Property | 2017-05-16 | Paper |
| Lower bounds by Birkhoff interpolation | 2017-02-14 | Paper |
| Factoring bivariate lacunary polynomials without heights | 2017-02-10 | Paper |
| Finding small degree factors of multivariate supersparse (lacunary) polynomials over algebraic number fields | 2017-02-03 | Paper |
| Complexity and dimension | 2016-05-26 | Paper |
| Lower Bounds for Sums of Powers of Low Degree Univariates | 2015-10-27 | Paper |
| Log-Concavity and Lower Bounds for Arithmetic Circuits | 2015-09-16 | Paper |
| On the complexity of factoring bivariate supersparse (Lacunary) polynomials | 2015-07-16 | Paper |
| A \(\tau \)-conjecture for Newton polygons | 2015-04-20 | Paper |
| Upper bounds on real roots and lower bounds for the permanent | 2015-03-27 | Paper |
| On the intersection of a sparse curve and a low-degree curve: a polynomial version of the lost theorem | 2015-02-19 | Paper |
| A Wronskian approach to the real \(\tau\)-conjecture | 2014-12-09 | Paper |
| Counting Tropically Degenerate Valuations and p-adic Approaches to the Hardness of the Permanent | 2013-09-02 | Paper |
| On the complexity of the multivariate resultant | 2013-03-04 | Paper |
| Interpolation in Valiant's theory | 2012-09-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2911618 | 2012-08-31 | Paper |
| Arithmetic circuits: the chasm at depth four gets wider | 2012-08-09 | Paper |
| Symmetric Determinantal Representation of Weakly-Skew Circuits | 2012-01-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3105511 | 2012-01-05 | Paper |
| VPSPACE and a transfer theorem over the reals | 2011-02-18 | Paper |
| On the expressive power of CNF formulas of bounded tree- and clique-width | 2011-01-14 | Paper |
| The Multivariate Resultant Is NP-hard in Any Characteristic | 2010-09-03 | Paper |
| Adversary lower bounds for nonadaptive quantum algorithms | 2010-07-08 | Paper |
| VPSPACE and a transfer theorem over the complex field | 2009-11-06 | Paper |
| A Dichotomy Theorem for Polynomial Evaluation | 2009-10-16 | Paper |
| Decision Versus Evaluation in Algebraic Complexity | 2009-03-05 | Paper |
| Expressing a fraction of two determinants as a determinant | 2009-01-20 | Paper |
| On the Expressive Power of CNF Formulas of Bounded Tree- and Clique-Width | 2009-01-20 | Paper |
| VPSPACE and a Transfer Theorem over the Complex Field | 2008-09-17 | Paper |
| Adversary Lower Bounds for Nonadaptive Quantum Algorithms | 2008-07-10 | Paper |
| On the construction of a family of transversal subspaces over finite fields | 2008-06-17 | Paper |
| On the Expressive Power of Planar Perfect Matching and Permanents of Bounded Treewidth Matrices | 2008-05-27 | Paper |
| Finding a vector orthogonal to roughly half a collection of vectors | 2008-03-26 | Paper |
| The complexity of two problems on arithmetic circuits | 2008-01-07 | Paper |
| Quantum automata and algebraic groups | 2007-10-19 | Paper |
| Valiant’s Model: From Exponential Sums to Exponential Products | 2007-09-05 | Paper |
| VPSPACE and a transfer theorem over the reals | 2007-09-03 | Paper |
| The quantum query complexity of the abelian hidden subgroup problem | 2007-07-16 | Paper |
| Automata, Languages and Programming | 2006-01-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5702668 | 2005-11-02 | Paper |
| Decidable and Undecidable Problems about Quantum Automata | 2005-09-16 | Paper |
| Valiant's model and the cost of computing integers | 2005-03-01 | Paper |
| The theory of Liouville functions | 2005-02-09 | Paper |
| A rank theorem for Vandermonde matrices | 2004-08-06 | Paper |
| Vandermonde matrices, NP-completeness and transversal subspaces | 2004-05-27 | Paper |
| La limite des theories de courbes generiques | 2002-10-29 | Paper |
| The stability of saturated linear dynamical systems is undecidable | 2002-10-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4542570 | 2002-08-01 | Paper |
| Transfer theorems via sign conditions | 2002-07-14 | Paper |
| Back-and-forth systems for generic curves and a decision algorithm for the limit theory | 2002-05-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2768452 | 2002-04-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2754200 | 2001-11-11 | Paper |
| Deciding stability and mortality of piecewise affine dynamical systems | 2001-08-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4501556 | 2001-06-28 | Paper |
| On defining irreducibility | 2000-10-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4501520 | 2000-09-04 | Paper |
| Definability of Geometric Properties in Algebraically Closed Fields | 2000-06-13 | Paper |
| The complexity of local dimensions for constructible sets | 2000-05-09 | Paper |
| The real dimension problem is \(\text{NP}_{\mathbb R}\)-complete. | 2000-05-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4231918 | 2000-04-26 | Paper |
| Saturation and stability in the theory of computation over the reals | 2000-02-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4234080 | 1999-06-29 | Paper |
| A polynomial time algorithm for diophantine equations in one variable | 1999-06-20 | Paper |
| Elimination of parameters in the polynomial hierarchy | 1999-04-28 | Paper |
| Closed-form analytic maps in one and two dimensions can simulate universal Turing machines | 1999-01-12 | Paper |
| Vapnik-Chervonenkis dimension of recurrent neural networks | 1998-12-15 | Paper |
| Erratum: Elimination of constants from machines over algebraically closed fields | 1998-11-24 | Paper |
| Approximation and learning of convex superpositions | 1998-01-19 | Paper |
| Elimination of constants from machines over algebraically closed fields | 1997-08-26 | Paper |
| A weak version of the Blum, Shub, and Smale model | 1997-08-20 | Paper |
| Neural networks with quadratic VC dimension | 1997-03-18 | Paper |
| A family of universal recurrent networks | 1997-02-27 | Paper |
| Hilbert's Nullstellensatz is in the polynomial hierarchy | 1997-02-04 | Paper |
| Computing over the reals with addition and order: Higher complexity classes | 1996-05-05 | Paper |
| Computing over the reals with addition and order | 1995-10-09 | Paper |
| Computability with low-dimensional dynamical systems | 1994-09-25 | Paper |
| Bounds on the number of units for computing arbitrary dichotomies by multilayer perceptrons | 1994-04-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4281538 | 1994-04-07 | Paper |
