Login / Signup

Quantum and classical algorithms for approximate submodular function minimization.

Yassine HamoudiPatrick RebentrostAnsis RosmanisMiklos Santha
Published in: Quantum Inf. Comput. (2019)
Keyphrases
  • learning algorithm
  • bayesian networks
  • computational complexity
  • objective function
  • search space
  • worst case
  • greedy algorithm
  • quantum computation