default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNatacha Portier
Person information
- affiliation: ENS Lyon, France
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[j14]Arkadev Chattopadhyay, Bruno Grenet
, Pascal Koiran, Natacha Portier, Yann Strozecki:
Computing the multilinear factors of lacunary polynomials without heights. J. Symb. Comput. 104: 183-206 (2021)
2010 – 2019
- 2015
- [j13]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): 48-63 (2015) - [j12]Pascal Koiran, Natacha Portier, Sébastien Tavenas, Stéphan Thomassé:
A $$\tau $$ τ -Conjecture for Newton Polygons. Found. Comput. Math. 15(1): 185-197 (2015) - [j11]Pascal Koiran, Natacha Portier, Sébastien Tavenas:
A Wronskian approach to the real τ-conjecture. J. Symb. Comput. 68: 195-214 (2015) - 2014
- [e2]Ernst W. Mayr, Natacha Portier:
31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014), STACS 2014, March 5-8, 2014, Lyon, France. LIPIcs 25, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2014, ISBN 978-3-939897-65-1 [contents] - 2013
- [j10]Bruno Grenet, Pascal Koiran, Natacha Portier:
On the complexity of the multivariate resultant. J. Complex. 29(2): 142-157 (2013) - [c9]Arkadev Chattopadhyay, Bruno Grenet, Pascal Koiran, Natacha Portier, Yann Strozecki:
Factoring bivariate lacunary polynomials without heights. ISSAC 2013: 141-148 - [c8]Natacha Portier, Thomas Wilke:
Frontmatter, Table of Contents, Preface, Workshop Organization. STACS 2013 - [c7]Natacha Portier, Thomas Wilke:
Author Index. STACS 2013: 646-647 - [e1]Natacha Portier, Thomas Wilke:
30th International Symposium on Theoretical Aspects of Computer Science, STACS 2013, February 27 - March 2, 2013, Kiel, Germany. LIPIcs 20, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2013, ISBN 978-3-939897-50-7 [contents] - [i13]Pascal Koiran, Natacha Portier, Sébastien Tavenas, Stéphan Thomassé:
A tau-conjecture for Newton polygons. CoRR abs/1308.2286 (2013) - [i12]Pascal Koiran, Natacha Portier, J. Maurice Rojas:
Counting Tropically Degenerate Valuations and p-adic Approaches to the Hardness of the Permanent. CoRR abs/1309.0486 (2013) - [i11]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 abs/1310.2447 (2013) - [i10]Arkadev Chattopadhyay, Bruno Grenet, Pascal Koiran, Natacha Portier, Yann Strozecki:
Computing the multilinear factors of lacunary polynomials without heights. CoRR abs/1311.5694 (2013) - 2012
- [i9]Pascal Koiran, Natacha Portier, Sébastien Tavenas:
A Wronskian Approach to the real τ-conjecture. CoRR abs/1205.1015 (2012) - [i8]Arkadev Chattopadhyay, Bruno Grenet, Pascal Koiran, Natacha Portier, Yann Strozecki:
Factoring bivariate lacunary polynomials without heights. CoRR abs/1206.4224 (2012) - [i7]Bruno Grenet, Pascal Koiran, Natacha Portier:
On the Complexity of the Multivariate Resultant. CoRR abs/1210.1451 (2012) - 2011
- [j9]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): 820-833 (2011) - [c6]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: 127-139 - [c5]Bruno Grenet, Erich L. Kaltofen, Pascal Koiran, Natacha Portier:
Symmetric Determinantal Representation of Weakly-Skew Circuits. STACS 2011: 543-554 - [i6]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 abs/1107.1434 (2011) - 2010
- [j8]Pascal Koiran, Jürgen Landes, Natacha Portier, Penghui Yao:
Adversary lower bounds for nonadaptive quantum algorithms. J. Comput. Syst. Sci. 76(5): 347-355 (2010) - [c4]Bruno Grenet, Pascal Koiran, Natacha Portier:
The Multivariate Resultant Is NP-hard in Any Characteristic. MFCS 2010: 477-488 - [i5]Bruno Grenet, Erich L. Kaltofen, Pascal Koiran, Natacha Portier:
Symmetric Determinantal Representation of Formulas and Weakly Skew Circuits. CoRR abs/1007.3804 (2010) - [i4]Vincent D. Blondel, Stéphane Gaubert, Natacha Portier:
The set of realizations of a max-plus linear sequence is semi-polyhedral. CoRR abs/1010.3685 (2010)
2000 – 2009
- 2009
- [i3]Bruno Grenet, Pascal Koiran, Natacha Portier:
The multivariate resultant lies between NP and AM. CoRR abs/0912.2607 (2009) - 2008
- [j7]Guillaume Malod, Natacha Portier:
Characterizing Valiant's algebraic complexity classes. J. Complex. 24(1): 16-38 (2008) - [c3]Pascal Koiran, Jürgen Landes, Natacha Portier, Penghui Yao:
Adversary Lower Bounds for Nonadaptive Quantum Algorithms. WoLLIC 2008: 226-237 - [i2]Pascal Koiran, Jürgen Landes, Natacha Portier, Penghui Yao:
Adversary lower bounds for nonadaptive quantum algorithms. CoRR abs/0804.1440 (2008) - 2007
- [j6]Pascal Koiran, Vincent Nesme, Natacha Portier:
The quantum query complexity of the abelian hidden subgroup problem. Theor. Comput. Sci. 380(1-2): 115-126 (2007) - 2006
- [c2]Guillaume Malod, Natacha Portier:
Characterizing Valiant's Algebraic Complexity Classes. MFCS 2006: 704-716 - 2005
- [j5]Vincent D. Blondel, Emmanuel Jeandel, Pascal Koiran, Natacha Portier:
Decidable and Undecidable Problems about Quantum Automata. SIAM J. Comput. 34(6): 1464-1473 (2005) - [c1]Pascal Koiran, Vincent Nesme, Natacha Portier:
A Quantum Lower Bound for the Query Complexity of Simon's Problem. ICALP 2005: 1287-1298 - [i1]Pascal Koiran, Vincent Nesme, Natacha Portier:
A quantum lower bound for the query complexity of Simon's problem. CoRR abs/quant-ph/0501060 (2005) - 2001
- [j4]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): 257-275 (2001) - 2000
- [j3]Natacha Portier:
Le Problème des Grandes Puissances Et Celui des Grandes Racines. J. Symb. Log. 65(4): 1675-1685 (2000)
1990 – 1999
- 1999
- [j2]Natacha Portier:
Stabilité Polynômiale des Corps Différentiels. J. Symb. Log. 64(2): 803-816 (1999) - 1998
- [j1]Natacha Portier:
Résolutions universelles pour des problèmes NP-complets. Theor. Comput. Sci. 201(1-2): 137-150 (1998)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-22 19:46 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
