Login / Signup

On the Impossibility of a Quantum Sieve Algorithm for Graph Isomorphism.

Cristopher MooreAlexander RussellPiotr Sniady
Published in: SIAM J. Comput. (2010)
Keyphrases
  • graph isomorphism
  • dynamic programming
  • matching algorithm
  • computational complexity
  • optimal solution
  • np hard
  • pairwise
  • search space
  • information extraction
  • np complete
  • distance function
  • image matching
  • spanning tree