Login / Signup

On Efficiently Solvable Cases of Quantum k-SAT.

Marco AldiNiel de BeaudrapSevag GharibianSeyran Saeedi
Published in: MFCS (2018)
Keyphrases
  • special case
  • np complete
  • satisfiability problem
  • np hard
  • learning algorithm
  • search algorithm
  • computational complexity
  • case based reasoning
  • case base
  • phase transition