mirage

Parcourir par l'auteur "Nesme, Vincent"

Système d'archivage DSpace/Manakin

Parcourir par l'auteur "Nesme, Vincent"

Tri par : Ordre : Résultats :

  • On the probabilistic query complexity of transitively symmetric problems
    Koiran, Pascal; Nesme, Vincent; Portier, Natacha; Laboratoire de l'informatique du parallélisme (LIP, 2006-08-30)
    (eng) We obtain optimal lower bounds on the nonadaptive probabilistic query complexity of a class of problems defined by a rather weak symmetry condition. In fact, for each problem in this class, given a number T of queries ...
  • The Quantum Query Complexity of the Abelian Hidden Subgroup Problem.
    Laboratoire de l'informatique du parallélisme; Koiran, Pascal; Nesme, Vincent; Portier, Natacha (2005-04)
    (eng) Simon in his FOCS'94 paper was the first to show an exponential gap between classical and quantum computation. The problem he dealt with is now part of a well-studied class of problems, the hidden subgroup problems. ...
Bookmark and Share