Login / Signup

Denesting by Bounded Degree Radicals.

Johannes Blömer
Published in: ESA (1997)
Keyphrases
  • bounded degree
  • graph theoretic
  • bounded treewidth
  • machine learning
  • np complete
  • simulated annealing
  • social networks
  • reinforcement learning
  • computational complexity
  • database
  • search space
  • np hard
  • conjunctive queries