|
|
|
|
Venues (Conferences, Journals, ...)
|
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 5 occurrences of 5 keywords
|
|
|
|
|
Results
Found 21 publication records. Showing 21 according to the selection in the facets
| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | 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 |
DBLP BibTeX RDF |
|
| 1 | 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. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Bruno Grenet, Erich Kaltofen, Pascal Koiran, Natacha Portier |
Symmetric Determinantal Representation of Weakly-Skew Circuits. |
STACS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
DBLP DOI BibTeX RDF |
|
| 1 | Vincent D. Blondel, Stéphane Gaubert, Natacha Portier |
The set of realizations of a max-plus linear sequence is semi-polyhedral |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Bruno Grenet, Erich Kaltofen, Pascal Koiran, Natacha Portier |
Symmetric Determinantal Representation of Formulas and Weakly Skew Circuits |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Pascal Koiran, Jürgen Landes, Natacha Portier, Penghui Yao |
Adversary lower bounds for nonadaptive quantum algorithms. |
J. Comput. Syst. Sci. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Bruno Grenet, Pascal Koiran, Natacha Portier |
The Multivariate Resultant Is NP-hard in Any Characteristic. |
MFCS |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Bruno Grenet, Pascal Koiran, Natacha Portier |
The multivariate resultant lies between NP and AM |
CoRR |
2009 |
DBLP BibTeX RDF |
|
| 1 | Guillaume Malod, Natacha Portier |
Characterizing Valiant's algebraic complexity classes. |
J. Complexity |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Pascal Koiran, Jürgen Landes, Natacha Portier, Penghui Yao |
Adversary lower bounds for nonadaptive quantum algorithms |
CoRR |
2008 |
DBLP BibTeX RDF |
|
| 1 | Pascal Koiran, Jürgen Landes, Natacha Portier, Penghui Yao |
Adversary Lower Bounds for Nonadaptive Quantum Algorithms. |
WoLLIC |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Pascal Koiran, Vincent Nesme, Natacha Portier |
The quantum query complexity of the abelian hidden subgroup problem. |
Theor. Comput. Sci. |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Guillaume Malod, Natacha Portier |
Characterizing Valiant's Algebraic Complexity Classes. |
MFCS |
2006 |
DBLP DOI BibTeX RDF |
Valiant’s theory, skew circuits, polynomials, Determinant, arithmetic circuits, Permanent, Algebraic complexity |
| 1 | Pascal Koiran, Vincent Nesme, Natacha Portier |
A quantum lower bound for the query complexity of Simon's problem |
CoRR |
2005 |
DBLP BibTeX RDF |
|
| 1 | Vincent D. Blondel, Emmanuel Jeandel, Pascal Koiran, Natacha Portier |
Decidable and Undecidable Problems about Quantum Automata. |
SIAM J. Comput. |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Pascal Koiran, Vincent Nesme, Natacha Portier |
A Quantum Lower Bound for the Query Complexity of Simon's Problem. |
ICALP |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Pascal Koiran, Natacha Portier |
Back-and-forth systems for generic curves and a decision algorithm for the limit theory. |
Ann. Pure Appl. Logic |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Natacha Portier |
Le Problème des Grandes Puissances Et Celui des Grandes Racines. |
J. Symb. Log. |
2000 |
DBLP BibTeX RDF |
|
| 1 | Natacha Portier |
Stabilité Polynômiale des Corps Différentiels. |
J. Symb. Log. |
1999 |
DBLP BibTeX RDF |
|
| 1 | Natacha Portier |
Résolutions universelles pour des problèmes NP-complets. |
Theor. Comput. Sci. |
1998 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #21 of 21 (100 per page; Change: )
|
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")