| Publication | Date of Publication | Type |
|---|
PT-symmetry in one-way wormholes
Annals of Physics | 2024-11-12 | Paper |
On the uniqueness and computation of commuting extensions
Linear Algebra and its Applications | 2024-11-09 | Paper |
Blackbox absolute reconstruction for sums of powers of linear forms
| 2024-09-12 | Paper |
Complete decomposition of symmetric tensors in linear time and polylogarithmic precision
Lecture Notes in Computer Science | 2023-10-04 | Paper |
Absolute reconstruction for sums of powers of linear forms: degree 3 and beyond
Computational Complexity | 2023-08-16 | Paper |
Derandomization and absolute reconstruction for sums of powers of linear forms
Theoretical Computer Science | 2021-09-27 | Paper |
Orthogonal tensor decomposition and orbit closures from a linear algebraic perspective
Linear and Multilinear Algebra | 2021-09-13 | Paper |
Computing the multilinear factors of lacunary polynomials without heights
Journal of Symbolic Computation | 2021-02-18 | Paper |
Polynomial equivalence problems for sum of affine powers
Proceedings of the 2018 ACM International Symposium on Symbolic and Algebraic Computation | 2020-09-09 | Paper |
Reconstruction algorithms for sums of affine powers
Proceedings of the 2017 ACM International Symposium on Symbolic and Algebraic Computation | 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
Journal of Pure and Applied Algebra | 2020-02-24 | Paper |
Reconstruction algorithms for sums of affine powers
Journal of Symbolic Computation | 2020-01-15 | Paper |
Root separation for trinomials
Journal of Symbolic Computation | 2019-06-28 | Paper |
Orbits of monomials and factorization into products of linear forms
| 2018-07-10 | Paper |
On the complexity of partial derivatives
| 2018-04-19 | Paper |
On the linear independence of shifted powers
Journal of Complexity | 2018-03-12 | Paper |
Hidden Cliques and the Certification of the Restricted Isometry Property
IEEE Transactions on Information Theory | 2017-05-16 | Paper |
Lower bounds by Birkhoff interpolation
Journal of Complexity | 2017-02-14 | Paper |
Factoring bivariate lacunary polynomials without heights
Proceedings of the 38th International Symposium on Symbolic and Algebraic Computation | 2017-02-10 | Paper |
Finding small degree factors of multivariate supersparse (lacunary) polynomials over algebraic number fields
Proceedings of the 2006 international symposium on Symbolic and algebraic computation | 2017-02-03 | Paper |
Complexity and dimension
Information Processing Letters | 2016-05-26 | Paper |
Lower bounds for sums of powers of low degree univariates
Automata, Languages, and Programming | 2015-10-27 | Paper |
Log-concavity and lower bounds for arithmetic circuits
Mathematical Foundations of Computer Science 2015 | 2015-09-16 | Paper |
On the complexity of factoring bivariate supersparse (lacunary) polynomials
Proceedings of the 2005 international symposium on Symbolic and algebraic computation | 2015-07-16 | Paper |
A \(\tau \)-conjecture for Newton polygons
Foundations of Computational Mathematics | 2015-04-20 | Paper |
Upper bounds on real roots and lower bounds for the permanent
Proceedings of the 37th International Symposium on Symbolic and Algebraic Computation | 2015-03-27 | Paper |
On the intersection of a sparse curve and a low-degree curve: a polynomial version of the lost theorem
Discrete & Computational Geometry | 2015-02-19 | Paper |
A Wronskian approach to the real \(\tau\)-conjecture
Journal of Symbolic Computation | 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
Journal of Complexity | 2013-03-04 | Paper |
Interpolation in Valiant's theory
Computational Complexity | 2012-09-21 | Paper |
The limited power of powering: polynomial identity testing and a depth-four lower bound for the permanent
| 2012-08-31 | Paper |
Arithmetic circuits: the chasm at depth four gets wider
Theoretical Computer Science | 2012-08-09 | Paper |
Symmetric Determinantal Representation of Weakly-Skew Circuits
| 2012-01-23 | Paper |
Symmetric determinantal representation of formulas and weakly skew circuits
| 2012-01-05 | Paper |
VPSPACE and a transfer theorem over the reals
Computational Complexity | 2011-02-18 | Paper |
On the expressive power of CNF formulas of bounded tree- and clique-width
Discrete Applied Mathematics | 2011-01-14 | Paper |
The multivariate resultant is NP-hard in any characteristic
Mathematical Foundations of Computer Science 2010 | 2010-09-03 | Paper |
Adversary lower bounds for nonadaptive quantum algorithms
Journal of Computer and System Sciences | 2010-07-08 | Paper |
VPSPACE and a transfer theorem over the complex field
Theoretical Computer Science | 2009-11-06 | Paper |
A Dichotomy Theorem for Polynomial Evaluation
Mathematical Foundations of Computer Science 2009 | 2009-10-16 | Paper |
Decision Versus Evaluation in Algebraic Complexity
Lecture Notes in Computer Science | 2009-03-05 | Paper |
Expressing a fraction of two determinants as a determinant
Proceedings of the twenty-first international symposium on Symbolic and algebraic computation | 2009-01-20 | Paper |
On the Expressive Power of CNF Formulas of Bounded Tree- and Clique-Width
Graph-Theoretic Concepts in Computer Science | 2009-01-20 | Paper |
VPSPACE and a Transfer Theorem over the Complex Field
Mathematical Foundations of Computer Science 2007 | 2008-09-17 | Paper |
Adversary Lower Bounds for Nonadaptive Quantum Algorithms
Logic, Language, Information and Computation | 2008-07-10 | Paper |
On the construction of a family of transversal subspaces over finite fields
Linear Algebra and its Applications | 2008-06-17 | Paper |
On the Expressive Power of Planar Perfect Matching and Permanents of Bounded Treewidth Matrices
Algorithms and Computation | 2008-05-27 | Paper |
Finding a vector orthogonal to roughly half a collection of vectors
Journal of Complexity | 2008-03-26 | Paper |
The complexity of two problems on arithmetic circuits
Theoretical Computer Science | 2008-01-07 | Paper |
Quantum automata and algebraic groups
Journal of Symbolic Computation | 2007-10-19 | Paper |
Valiant’s Model: From Exponential Sums to Exponential Products
Lecture Notes in Computer Science | 2007-09-05 | Paper |
VPSPACE and a transfer theorem over the reals
Lecture Notes in Computer Science | 2007-09-03 | Paper |
The quantum query complexity of the abelian hidden subgroup problem
Theoretical Computer Science | 2007-07-16 | Paper |
Automata, Languages and Programming
Lecture Notes in Computer Science | 2006-01-10 | Paper |
scientific article; zbMATH DE number 2222019 (Why is no real title available?)
| 2005-11-02 | Paper |
Decidable and Undecidable Problems about Quantum Automata
SIAM Journal on Computing | 2005-09-16 | Paper |
Valiant's model and the cost of computing integers
Computational Complexity | 2005-03-01 | Paper |
The theory of Liouville functions
Journal of Symbolic Logic | 2005-02-09 | Paper |
A rank theorem for Vandermonde matrices
Linear Algebra and its Applications | 2004-08-06 | Paper |
Vandermonde matrices, NP-completeness and transversal subspaces
Foundations of Computational Mathematics | 2004-05-27 | Paper |
La limite des theories de courbes generiques
Journal of Symbolic Logic | 2002-10-29 | Paper |
The stability of saturated linear dynamical systems is undecidable
Journal of Computer and System Sciences | 2002-10-15 | Paper |
scientific article; zbMATH DE number 1775437 (Why is no real title available?)
| 2002-08-01 | Paper |
Transfer theorems via sign conditions
Information Processing Letters | 2002-07-14 | Paper |
Back-and-forth systems for generic curves and a decision algorithm for the limit theory
Annals of Pure and Applied Logic | 2002-05-13 | Paper |
The topological entropy of iterated piecewise affine maps is uncomputable
Discrete Mathematics and Theoretical Computer Science. DMTCS | 2002-04-23 | Paper |
scientific article; zbMATH DE number 1670874 (Why is no real title available?)
| 2001-11-11 | Paper |
Deciding stability and mortality of piecewise affine dynamical systems
Theoretical Computer Science | 2001-08-20 | Paper |
scientific article; zbMATH DE number 1500537 (Why is no real title available?)
| 2001-06-28 | Paper |
On defining irreducibility
Comptes Rendus de l'Académie des Sciences - Series I - Mathematics | 2000-10-12 | Paper |
scientific article; zbMATH DE number 1500505 (Why is no real title available?)
| 2000-09-04 | Paper |
Definability of Geometric Properties in Algebraically Closed Fields
Mathematical Logic Quarterly | 2000-06-13 | Paper |
The complexity of local dimensions for constructible sets
Journal of Complexity | 2000-05-09 | Paper |
The real dimension problem is \(\text{NP}_{\mathbb R}\)-complete.
Journal of Complexity | 2000-05-07 | Paper |
scientific article; zbMATH DE number 1261815 (Why is no real title available?)
| 2000-04-26 | Paper |
Saturation and stability in the theory of computation over the reals
Annals of Pure and Applied Logic | 2000-02-08 | Paper |
scientific article; zbMATH DE number 1263209 (Why is no real title available?)
| 1999-06-29 | Paper |
A polynomial time algorithm for diophantine equations in one variable
Journal of Symbolic Computation | 1999-06-20 | Paper |
Elimination of parameters in the polynomial hierarchy
Theoretical Computer Science | 1999-04-28 | Paper |
Closed-form analytic maps in one and two dimensions can simulate universal Turing machines
Theoretical Computer Science | 1999-01-12 | Paper |
Vapnik-Chervonenkis dimension of recurrent neural networks
Discrete Applied Mathematics | 1998-12-15 | Paper |
Erratum: Elimination of constants from machines over algebraically closed fields
Journal of Complexity | 1998-11-24 | Paper |
Approximation and learning of convex superpositions
Journal of Computer and System Sciences | 1998-01-19 | Paper |
Elimination of constants from machines over algebraically closed fields
Journal of Complexity | 1997-08-26 | Paper |
A weak version of the Blum, Shub, and Smale model
Journal of Computer and System Sciences | 1997-08-20 | Paper |
Neural networks with quadratic VC dimension
Journal of Computer and System Sciences | 1997-03-18 | Paper |
A family of universal recurrent networks
Theoretical Computer Science | 1997-02-27 | Paper |
Hilbert's Nullstellensatz is in the polynomial hierarchy
Journal of Complexity | 1997-02-04 | Paper |
Computing over the reals with addition and order: Higher complexity classes
Journal of Complexity | 1996-05-05 | Paper |
Computing over the reals with addition and order
Theoretical Computer Science | 1995-10-09 | Paper |
Computability with low-dimensional dynamical systems
Theoretical Computer Science | 1994-09-25 | Paper |
Bounds on the number of units for computing arbitrary dichotomies by multilayer perceptrons
Journal of Complexity | 1994-04-12 | Paper |
scientific article; zbMATH DE number 512843 (Why is no real title available?)
| 1994-04-07 | Paper |
On the uniqueness and computation of commuting extensions
| N/A | Paper |
An efficient uniqueness theorem for overcomplete tensor decomposition
| N/A | Paper |
