| Publication | Date of Publication | Type |
|---|
Computing the multilinear factors of lacunary polynomials without heights
Journal of Symbolic Computation | 2021-02-18 | Paper |
| Quantum physics, information and computation. From concepts to applications | 2021-01-09 | Paper |
Factoring bivariate lacunary polynomials without heights
Proceedings of the 38th International Symposium on Symbolic and Algebraic Computation | 2017-02-10 | Paper |
A \(\tau \)-conjecture for Newton polygons
Foundations of Computational Mathematics | 2015-04-20 | 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 |
The limited power of powering: polynomial identity testing and a depth-four lower bound for the permanent
(available as arXiv preprint) | 2012-08-31 | 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 |
The set of realizations of a max-plus linear sequence is semi-polyhedral
Journal of Computer and System Sciences | 2011-04-28 | 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 |
Adversary Lower Bounds for Nonadaptive Quantum Algorithms
Logic, Language, Information and Computation | 2008-07-10 | Paper |
Characterizing Valiant's algebraic complexity classes
Journal of Complexity | 2008-03-26 | Paper |
Characterizing Valiant’s Algebraic Complexity Classes
Lecture Notes in Computer Science | 2007-09-05 | 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 |
Decidable and Undecidable Problems about Quantum Automata
SIAM Journal on Computing | 2005-09-16 | Paper |
A rank theorem for Vandermonde matrices
Linear Algebra and its Applications | 2004-08-06 | Paper |
The problem of large powers and that of large roots
The Journal of Symbolic Logic | 2003-03-09 | Paper |
The presence of a zero in an integer linear recurrent sequence is NP-hard to decide
Linear Algebra and its Applications | 2002-08-28 | 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 minimal realization problem in the max-plus semiring and Pisot's problem are \(NP\)-hard
Comptes Rendus de l'Académie des Sciences. Série I. Mathématique | 2002-03-13 | Paper |
Stabilité polynômiale des corps différentiels
Journal of Symbolic Logic | 2000-07-05 | Paper |
Universal resolution for NP-complete problems
Theoretical Computer Science | 1998-08-13 | Paper |
