Résolutions universelles pour des problèmes NP-complets. - Natacha Portier (Theor. Comput. Sci., 1998)

Stabilité Polynômiale des Corps Différentiels. - Natacha Portier (J. Symb. Log., 1999)

Le Problème des Grandes Puissances Et Celui des Grandes Racines. - Natacha Portier (J. Symb. Log., 2000)

Back-and-forth systems for generic curves and a decision algorithm for the limit theory. - Pascal Koiran; Natacha Portier (Ann. Pure Appl. Log., 2001)

A Quantum Lower Bound for the Query Complexity of Simon's Problem. - Pascal Koiran; Vincent Nesme; Natacha Portier (ICALP, 2005)

Decidable and Undecidable Problems about Quantum Automata. - Vincent D. Blondel; Emmanuel Jeandel; Pascal Koiran; Natacha Portier (SIAM J. Comput., 2005)

The quantum query complexity of the abelian hidden subgroup problem. - Pascal Koiran; Vincent Nesme; Natacha Portier (Theor. Comput. Sci., 2007)

Characterizing Valiant's algebraic complexity classes. - Guillaume Malod; Natacha Portier (J. Complex., 2008)

The multivariate resultant lies between NP and AM - Bruno Grenet; Pascal Koiran; Natacha Portier (CoRR, 2009)

The Multivariate Resultant Is NP-hard in Any Characteristic. - Bruno Grenet; Pascal Koiran; Natacha Portier (MFCS, 2010)

Symmetric Determinantal Representation of Formulas and Weakly Skew Circuits - Bruno Grenet; Erich L. Kaltofen; Pascal Koiran; Natacha Portier (CoRR, 2010)

Adversary lower bounds for nonadaptive quantum algorithms. - Pascal Koiran; Jürgen Landes; Natacha Portier; Penghui Yao (J. Comput. Syst. Sci., 2010)

The Limited Power of Powering: Polynomial Identity Testing and a Depth-four Lower Bound for the Permanent. - Bruno Grenet; Pascal Koiran; Natacha Portier; Yann Strozecki (FSTTCS, 2011)

Symmetric Determinantal Representation of Weakly-Skew Circuits. - Bruno Grenet; Erich L. Kaltofen; Pascal Koiran; Natacha Portier (STACS, 2011)

The set of realizations of a max-plus linear sequence is semi-polyhedral. - Vincent D. Blondel; Stéphane Gaubert; Natacha Portier (J. Comput. Syst. Sci., 2011)

Factoring bivariate lacunary polynomials without heights. - Arkadev Chattopadhyay; Bruno Grenet; Pascal Koiran; Natacha Portier; Yann Strozecki (ISSAC, 2013)

Frontmatter, Table of Contents, Preface, Workshop Organization. - Natacha Portier; Thomas Wilke (STACS, 2013)

Author Index. - Natacha Portier; Thomas Wilke (STACS, 2013)

Counting Tropically Degenerate Valuations and p-adic Approaches to the Hardness of the Permanent. - Pascal Koiran; Natacha Portier; J. Maurice Rojas (CoRR, 2013)

A tau-conjecture for Newton polygons. - Pascal Koiran; Natacha Portier; Sébastien Tavenas; Stéphan Thomassé (CoRR, 2013)

On the complexity of the multivariate resultant. - Bruno Grenet; Pascal Koiran; Natacha Portier (J. Complex., 2013)

On the Intersection of a Sparse Curve and a Low-Degree Curve: A Polynomial Version of the Lost Theorem. - Pascal Koiran; Natacha Portier; Sébastien Tavenas (Discret. Comput. Geom., 2015)

A $$ tau $$ τ -Conjecture for Newton Polygons. - Pascal Koiran; Natacha Portier; Sébastien Tavenas; Stéphan Thomassé (Found. Comput. Math., 2015)

A Wronskian approach to the real τ-conjecture. - Pascal Koiran; Natacha Portier; Sébastien Tavenas (J. Symb. Comput., 2015)

Computing the multilinear factors of lacunary polynomials without heights. - Arkadev Chattopadhyay; Bruno Grenet; Pascal Koiran; Natacha Portier; Yann Strozecki (J. Symb. Comput., 2021)