"ASP-Completeness of Hamiltonicity in Grid Graphs, with Applications to ..."

MIT Hardness Group et al. (2024)

> Home

Details and statistics

DOI: 10.4230/LIPICS.FUN.2024.23

access: open

type: Conference or Workshop Paper

metadata version: 2024-06-03

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - conf/fun/GroupBCDHT24
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/fun/GroupBCDHT24
MIT Hardness Group, Josh Brunner, Lily Chung, Erik D. Demaine, Della H. Hendrickson, Andy Tockman:
ASP-Completeness of Hamiltonicity in Grid Graphs, with Applications to Loop Puzzles. FUN 2024: 23:1-23:20

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.