Login / Signup

Experimental verification of NP-complete problems via linear optics.

Jian LiTongjun LiuTianlei HouXiaorun WangChenxi LiuPan DaiQin Wang
Published in: WCSP (2021)
Keyphrases
  • experimental verification
  • np complete problems
  • np complete
  • graph coloring
  • phase transition
  • neural network
  • hard problems
  • artificial neural networks
  • search space
  • branch and bound