An NL-Complete Puzzle
classification
💻 cs.CC
keywords
nl-completepuzzlecomplexityinvestigateturns
read the original abstract
We investigate the complexity of a puzzle that turns out to be NL-complete.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.