|
Search the dblp DataBase
Vincent Nesme:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
- Pascal Koiran, Vincent Nesme, Natacha Portier
A Quantum Lower Bound for the Query Complexity of Simon's Problem. [Citation Graph (0, 0)][DBLP] ICALP, 2005, pp:1287-1298 [Conf]
- Pascal Koiran, Vincent Nesme, Natacha Portier
A quantum lower bound for the query complexity of Simon's problem [Citation Graph (0, 0)][DBLP] CoRR, 2005, v:0, n:, pp:- [Journal]
- Pascal Koiran, Vincent Nesme, Natacha Portier
The quantum query complexity of the abelian hidden subgroup problem. [Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 2007, v:380, n:1-2, pp:115-126 [Journal]
One-Dimensional Quantum Cellular Automata over Finite, Unbounded Configurations. [Citation Graph (, )][DBLP]
Quantization of cellular automata. [Citation Graph (, )][DBLP]
Note on sampling without replacing from a finite collection of matrices [Citation Graph (, )][DBLP]
Search in 0.000secs, Finished in 0.000secs
|