ASP-Completeness of Hamiltonicity in Grid Graphs, with Applications to Loop Puzzles

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	MIT Hardness Group, Brunner, Josh, Chung, Lily, Demaine, Erik D., Diomidova, Jenny, Hendrickson, Della, Tockman, Andy
Format:	Preprint
Published:	2024
Subjects:	Computational Complexity 68Q25
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Internet

https://arxiv.org/abs/2405.08377