Login / Signup

Complexity of Planar Graph Orientation Consistency, Promise-Inference, and Uniqueness, with Applications to Minesweeper Variants.

MIT Hardness GroupDella H. HendricksonAndy Tockman
Published in: FUN (2024)
Keyphrases
  • planar graphs
  • computational complexity
  • worst case
  • belief networks
  • bayesian inference
  • bayesian networks
  • efficient learning