Login / Signup

On the quantum hardness of solving isomorphism problems as nonabelian hidden shift problems.

Andrew M. ChildsPawel Wocjan
Published in: Quantum Inf. Comput. (2007)
Keyphrases
  • evolutionary algorithm
  • solving problems
  • neural network
  • data mining
  • optimization problems
  • np complete
  • np hardness
  • solving complex