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

Documenti analoghi

• ASP-Completeness of Hamiltonicity in Grid Graphs, with Applications to Loop Puzzles
  di: MIT Hardness Group, et al.
  Pubblicazione: (2024)
• Planar Graph Orientation Frameworks, Applied to KPlumber and Polyomino Tiling
  di: MIT Hardness Group, et al.
  Pubblicazione: (2026)
• Tetris is Hard with Just One Piece Type
  di: MIT Hardness Group, et al.
  Pubblicazione: (2026)
• Pushing Blocks without Fixed Walls via Checkable Gizmos: Push-1 is PSPACE-Complete
  di: MIT Hardness Group, et al.
  Pubblicazione: (2025)
• Tetris with Few Piece Types
  di: MIT Hardness Group, et al.
  Pubblicazione: (2024)