Natacha Portier

From MaRDI portal
Person:208825

Available identifiers

zbMath Open portier.natachaWikidataQ102257140 ScholiaQ102257140MaRDI QIDQ208825

List of research outcomes





PublicationDate of PublicationType
Computing the multilinear factors of lacunary polynomials without heights2021-02-18Paper
Quantum physics, information and computation. From concepts to applications2021-01-09Paper
Factoring bivariate lacunary polynomials without heights2017-02-10Paper
A \(\tau \)-conjecture for Newton polygons2015-04-20Paper
On the intersection of a sparse curve and a low-degree curve: a polynomial version of the lost theorem2015-02-19Paper
A Wronskian approach to the real \(\tau\)-conjecture2014-12-09Paper
Counting Tropically Degenerate Valuations and p-adic Approaches to the Hardness of the Permanent2013-09-02Paper
On the complexity of the multivariate resultant2013-03-04Paper
The limited power of powering: polynomial identity testing and a depth-four lower bound for the permanent2012-08-31Paper
Symmetric Determinantal Representation of Weakly-Skew Circuits2012-01-23Paper
Symmetric determinantal representation of formulas and weakly skew circuits2012-01-05Paper
The set of realizations of a max-plus linear sequence is semi-polyhedral2011-04-28Paper
The multivariate resultant is NP-hard in any characteristic2010-09-03Paper
Adversary lower bounds for nonadaptive quantum algorithms2010-07-08Paper
Adversary Lower Bounds for Nonadaptive Quantum Algorithms2008-07-10Paper
Characterizing Valiant's algebraic complexity classes2008-03-26Paper
Characterizing Valiant’s Algebraic Complexity Classes2007-09-05Paper
The quantum query complexity of the abelian hidden subgroup problem2007-07-16Paper
Automata, Languages and Programming2006-01-10Paper
Decidable and Undecidable Problems about Quantum Automata2005-09-16Paper
A rank theorem for Vandermonde matrices2004-08-06Paper
The problem of large powers and that of large roots2003-03-09Paper
The presence of a zero in an integer linear recurrent sequence is NP-hard to decide2002-08-28Paper
Back-and-forth systems for generic curves and a decision algorithm for the limit theory2002-05-13Paper
The minimal realization problem in the max-plus semiring and Pisot's problem are \(NP\)-hard2002-03-13Paper
Stabilité polynômiale des corps différentiels2000-07-05Paper
Universal resolution for NP-complete problems1998-08-13Paper

Research outcomes over time

This page was built for person: Natacha Portier