Natacha Portier - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 23 from 23

2021

Computing the multilinear factors of lacunary polynomials without heightsArkadev Chattopadhyay, Bruno Grenet, Pascal Koiran, Natacha Portier, Yann Strozecki. JSC, 104:183-206, 2021. [doi]

2015

On the Intersection of a Sparse Curve and a Low-Degree Curve: A Polynomial Version of the Lost TheoremPascal Koiran, Natacha Portier, Sébastien Tavenas. dcg, 53(1):48-63, 2015. [doi]

A Wronskian approach to the real τ-conjecturePascal Koiran, Natacha Portier, Sébastien Tavenas. JSC, 68:195-214, 2015. [doi]

A $$\tau $$ τ -Conjecture for Newton PolygonsPascal Koiran, Natacha Portier, Sébastien Tavenas, Stéphan Thomassé. focm, 15(1):185-197, 2015. [doi]

2013

2011

2010

The Multivariate Resultant Is NP-hard in Any CharacteristicBruno Grenet, Pascal Koiran, Natacha Portier. mfcs 2010: 477-488 [doi]

Adversary lower bounds for nonadaptive quantum algorithmsPascal Koiran, Jürgen Landes, Natacha Portier, Penghui Yao. jcss, 76(5):347-355, 2010. [doi]

2008

Adversary Lower Bounds for Nonadaptive Quantum AlgorithmsPascal Koiran, Jürgen Landes, Natacha Portier, Penghui Yao. wollic 2008: 226-237 [doi]

Characterizing Valiant s algebraic complexity classesGuillaume Malod, Natacha Portier. jc, 24(1):16-38, 2008. [doi]

2007

The quantum query complexity of the abelian hidden subgroup problemPascal Koiran, Vincent Nesme, Natacha Portier. TCS, 380(1-2):115-126, 2007. [doi]

2006

Characterizing Valiant s Algebraic Complexity ClassesGuillaume Malod, Natacha Portier. mfcs 2006: 704-716 [doi]

2005

Decidable and Undecidable Problems about Quantum AutomataVincent D. Blondel, Emmanuel Jeandel, Pascal Koiran, Natacha Portier. SICOMP, 34(6):1464-1473, 2005. [doi]

A Quantum Lower Bound for the Query Complexity of Simon s ProblemPascal Koiran, Vincent Nesme, Natacha Portier. icalp 2005: 1287-1298 [doi]

2001

Back-and-forth systems for generic curves and a decision algorithm for the limit theoryPascal Koiran, Natacha Portier. APAL, 111(3):257-275, 2001.

2000

Le Problème des Grandes Puissances Et Celui des Grandes RacinesNatacha Portier. JSYML, 65(4):1675-1685, 2000.

1999

Stabilité Polynômiale des Corps DifférentielsNatacha Portier. JSYML, 64(2):803-816, 1999.

1998

Résolutions universelles pour des problèmes NP-completsNatacha Portier. TCS, 201(1-2):137-150, 1998. [doi]

Sign in or sign up to see more results.

runs on WebDSL