Natacha Portier

Publication Activity (10 Years)

Years Active: 1998-2021
Publications (10 Years): 4

Top Topics

Algebraic Curves

Geometric Objects

Factors That Affect

Lagrange Interpolation

Top Venues

J. Symb. Comput.

Discret. Comput. Geom.

Publications

Arkadev Chattopadhyay, Bruno Grenet, Pascal Koiran, Natacha Portier, Yann Strozecki
Computing the multilinear factors of lacunary polynomials without heights. J. Symb. Comput. 104 (2021)
Pascal Koiran, Natacha Portier, Sébastien Tavenas
On the Intersection of a Sparse Curve and a Low-Degree Curve: A Polynomial Version of the Lost Theorem. Discret. Comput. Geom. 53 (1) (2015)
Pascal Koiran, Natacha Portier, Sébastien Tavenas
A Wronskian approach to the real τ-conjecture. J. Symb. Comput. 68 (2015)
Pascal Koiran, Natacha Portier, Sébastien Tavenas, Stéphan Thomassé
A $$\tau $$ τ -Conjecture for Newton Polygons. Found. Comput. Math. 15 (1) (2015)
Pascal Koiran, Natacha Portier, Sébastien Tavenas, Stéphan Thomassé
A tau-conjecture for Newton polygons. CoRR (2013)
Bruno Grenet, Pascal Koiran, Natacha Portier
On the complexity of the multivariate resultant. J. Complex. 29 (2) (2013)
Arkadev Chattopadhyay, Bruno Grenet, Pascal Koiran, Natacha Portier, Yann Strozecki
Computing the multilinear factors of lacunary polynomials without heights. CoRR (2013)
Natacha Portier, Thomas Wilke
Author Index. STACS (2013)
Natacha Portier, Thomas Wilke
Frontmatter, Table of Contents, Preface, Workshop Organization. STACS (2013)
Pascal Koiran, Natacha Portier, J. Maurice Rojas
Counting Tropically Degenerate Valuations and p-adic Approaches to the Hardness of the Permanent. CoRR (2013)
Pascal Koiran, Natacha Portier, Sébastien Tavenas
On the intersection of a sparse curve and a low-degree curve: A polynomial version of the lost theorem. CoRR (2013)
Arkadev Chattopadhyay, Bruno Grenet, Pascal Koiran, Natacha Portier, Yann Strozecki
Factoring bivariate lacunary polynomials without heights. ISSAC (2013)
Bruno Grenet, Pascal Koiran, Natacha Portier
On the Complexity of the Multivariate Resultant CoRR (2012)
Arkadev Chattopadhyay, Bruno Grenet, Pascal Koiran, Natacha Portier, Yann Strozecki
Factoring bivariate lacunary polynomials without heights CoRR (2012)
Pascal Koiran, Natacha Portier, Sébastien Tavenas
A Wronskian Approach to the real τ-conjecture CoRR (2012)
Bruno Grenet, Pascal Koiran, Natacha Portier, Yann Strozecki
The Limited Power of Powering: Polynomial Identity Testing and a Depth-four Lower Bound for the Permanent. FSTTCS (2011)
Bruno Grenet, Erich Kaltofen, Pascal Koiran, Natacha Portier
Symmetric Determinantal Representation of Weakly-Skew Circuits. STACS (2011)
Vincent D. Blondel, Stéphane Gaubert, Natacha Portier
The set of realizations of a max-plus linear sequence is semi-polyhedral. J. Comput. Syst. Sci. 77 (4) (2011)
Bruno Grenet, Pascal Koiran, Natacha Portier, Yann Strozecki
The Limited Power of Powering: Polynomial Identity Testing and a Depth-four Lower Bound for the Permanent CoRR (2011)
Bruno Grenet, Pascal Koiran, Natacha Portier
The Multivariate Resultant Is NP-hard in Any Characteristic. MFCS (2010)
Vincent D. Blondel, Stéphane Gaubert, Natacha Portier
The set of realizations of a max-plus linear sequence is semi-polyhedral CoRR (2010)
Bruno Grenet, Erich Kaltofen, Pascal Koiran, Natacha Portier
Symmetric Determinantal Representation of Formulas and Weakly Skew Circuits CoRR (2010)
Pascal Koiran, Jürgen Landes, Natacha Portier, Penghui Yao
Adversary lower bounds for nonadaptive quantum algorithms. J. Comput. Syst. Sci. 76 (5) (2010)
Bruno Grenet, Pascal Koiran, Natacha Portier
The multivariate resultant lies between NP and AM CoRR (2009)
Pascal Koiran, Jürgen Landes, Natacha Portier, Penghui Yao
Adversary lower bounds for nonadaptive quantum algorithms CoRR (2008)
Guillaume Malod, Natacha Portier
Characterizing Valiant's algebraic complexity classes. J. Complex. 24 (1) (2008)
Pascal Koiran, Jürgen Landes, Natacha Portier, Penghui Yao
Adversary Lower Bounds for Nonadaptive Quantum Algorithms. WoLLIC (2008)
Pascal Koiran, Vincent Nesme, Natacha Portier
The quantum query complexity of the abelian hidden subgroup problem. Theor. Comput. Sci. 380 (1-2) (2007)
Guillaume Malod, Natacha Portier
Characterizing Valiant's Algebraic Complexity Classes. MFCS (2006)
Pascal Koiran, Vincent Nesme, Natacha Portier
A Quantum Lower Bound for the Query Complexity of Simon's Problem. ICALP (2005)
Vincent D. Blondel, Emmanuel Jeandel, Pascal Koiran, Natacha Portier
Decidable and Undecidable Problems about Quantum Automata. SIAM J. Comput. 34 (6) (2005)
Pascal Koiran, Vincent Nesme, Natacha Portier
A quantum lower bound for the query complexity of Simon's problem CoRR (2005)
Pascal Koiran, Natacha Portier
Back-and-forth systems for generic curves and a decision algorithm for the limit theory. Ann. Pure Appl. Log. 111 (3) (2001)
Natacha Portier
Le Problème des Grandes Puissances Et Celui des Grandes Racines. J. Symb. Log. 65 (4) (2000)
Natacha Portier
Stabilité Polynômiale des Corps Différentiels. J. Symb. Log. 64 (2) (1999)
Natacha Portier
Résolutions universelles pour des problèmes NP-complets. Theor. Comput. Sci. 201 (1-2) (1998)