An NL-Complete Puzzle
Computational Complexity
2015-07-13 v1
Authors:
Holger Petersen
Abstract
We investigate the complexity of a puzzle that turns out to be NL-complete.
Cite
@article{arxiv.1507.02723,
title = {An NL-Complete Puzzle},
author = {Holger Petersen},
journal= {arXiv preprint arXiv:1507.02723},
year = {2015}
}
Related papers
View all related →
Computational Complexity · Computer Science
Complexity Results of Persuasion
Alban Grastien
2025-07-09
Computational Geometry · Computer Science
Link Crossing Number is NP-hard
Arnaud de Mesmay, Marcus Schaefer, Eric Sedgwick
2019-08-13
Representation Theory · Mathematics
The Quiver Problem is NP Complete
Victor Kac, Bangzheng Li
2025-08-06
Computational Complexity · Computer Science
Generic case completeness
Alexei Miasnikov, Alexander Ushakov
2016-06-06
Computational Complexity · Computer Science
The Complexity of Some Combinatorial Puzzles
Holger Petersen
2015-08-03
Computational Complexity · Computer Science
Mastermind is NP-Complete
Jeff Stuckman, Guo-Qiang Zhang
2007-05-23
Computational Complexity · Computer Science
Sumplete is Hard, Even with Two Different Numbers
Suthee Ruangwises
2024-07-01
Combinatorics · Mathematics
Matching sequences of two digits in matrices is hard
Nicolaos Matsakis
2011-07-05
Computational Complexity · Computer Science
Transforming NP to P: An Approach to Solve NP Complete Problems
Wenhong Tian, GuoZhong Li, Xinyang Wang, Qin Xiong +1
2015-05-04
Logic · Mathematics
Incompleteness in the finite domain
Pavel Pudlak
2017-05-22
Discrete Mathematics · Computer Science
Slant/Gokigen Naname is NP-complete, and Some Variations are in P
Jayson Lynch, Jack Spalding-Jamieson
2025-02-20
Group Theory · Mathematics
Quadratic equations over free groups are NP-complete
O. Kharlampovich, I. G. Lysenok, A. G Myasnikov, N. W. M. Touikan
2014-03-27
History and Overview · Mathematics
It's Common Knowledge
Matvey Borodin, Aidan Duncan, Joshua Guo, Kunal Kapoor +6
2019-09-06
Computational Complexity · Computer Science
Losing at Checkers is Hard
Jeffrey Bosboom, Spencer Congero, Erik D. Demaine, Martin L. Demaine +1
2018-06-15
Combinatorics · Mathematics
Complexity problems in enumerative combinatorics
Igor Pak
2018-04-03
Logic in Computer Science · Computer Science
On the Complexity of the Numerically Definite Syllogistic and Related Fragments
Ian Pratt-Hartmann
2024-04-19
Computational Geometry · Computer Science
Symmetric Assembly Puzzles are Hard, Beyond a Few Pieces
Erik D. Demaine, Matias Korman, Jason S. Ku, Joseph S. B. Mitchell +5
2019-04-09
Computational Complexity · Computer Science
About accuracy of the solution of NP-complete tasks
Rustem Valeyev
2014-09-30
Other Computer Science · Computer Science
P vs NP Problem in the field anthropology
Michael A. Popov
2009-04-21
Computational Complexity · Computer Science
Complexity of the CNF-satisfiability problem
Grigoriy V. Bokov
2018-07-23
Formal Languages and Automata Theory · Computer Science
Diverse Palindromic Factorization is NP-Complete
Hideo Bannai, Travis Gagie, Shunsuke Inenaga, Juha Karkkainen +4
2020-12-15
Quantum Physics · Physics
Deciding whether a quantum state has secret correlations is an NP-complete problem
Jae-Weon Lee, DoYong Kwon, Jaewan Kim
2015-10-30
Discrete Mathematics · Computer Science
The complexity of UNO
Erik D. Demaine, Martin L. Demaine, Nicholas J. A. Harvey, Ryuhei Uehara +2
2013-12-03
Computational Complexity · Computer Science
The complexity of the list homomorphism problem for graphs
Laszlo Egri, Andrei Krokhin, Benoit Larose, Pascal Tesson
2010-02-03
General Mathematics · Mathematics
Thinking Inside and Outside the Box
Tanya Khovanova
2016-05-10