"A Framework for Loop and Path Puzzle Satisfiability NP-Hardness Results."

Hadyn Tang (2022)

Details and statistics

DOI:

access: open

type: Informal or Other Publication

metadata version: 2022-02-09

a service of  Schloss Dagstuhl - Leibniz Center for Informatics