Natacha Portier

38 papers A* 1A 5B 3C 1Journal 27Unranked 1

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