Image de couverture de livre

Parks: A Doubly Infinite Family of NP-Complete Puzzles and Generalizations of A002464

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Minevich, Igor, Cunningham, Gabe, Karan, Aditya, Gyllinsky, Joshua V.
Format:	Preprint
Publié:	2024
Sujets:	Computational Complexity Combinatorics
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Graph Powers of Groups II: The RA Matrix
par: Cunningham, Gabe, et autres
Publié: (2025)

Graph Powers of Groups
par: Cunningham, Gabe, et autres
Publié: (2025)

Completeness in the Polynomial Hierarchy and PSPACE for many natural problems derived from NP
par: Grüne, Christoph, et autres
Publié: (2026)

NP-Completeness of Deterministic Communication Complexity via Relaxed Interlacing
par: Gaspers, Serge, et autres
Publié: (2025)

King Chasing Problem in Chinese Chess is NP-hard
par: Li, Chao, et autres
Publié: (2026)

Optimal Union Probability Interval Is NP-Hard
par: Kaski, Petteri, et autres
Publié: (2026)

Computing the EHZ capacity is NP-hard
par: Leipold, Karla, et autres
Publié: (2024)

Determining the Outerthickness of Graphs Is NP-Hard
par: Lee, Pin-Hsian, et autres
Publié: (2026)

Flat origami is Turing Complete
par: Hull, Thomas C., et autres
Publié: (2023)

Real Stability and Log Concavity are coNP-Hard
par: Chin, Tracy
Publié: (2024)

NP-Completeness Proofs of Puzzles using the T-Metacell Framework
par: Kiatchaipipat, Nattapol, et autres
Publié: (2025)

NP-completeness of Tiling Finite Simply Connected Regions with a Fixed Set of Wang Tiles
par: Yang, Chao, et autres
Publié: (2024)

Classification of Non-redundancy of Boolean Predicates of Arity 4
par: Brakensiek, Joshua, et autres
Publié: (2026)

Generic Reed-Solomon Codes Achieve List-decoding Capacity
par: Brakensiek, Joshua, et autres
Publié: (2022)

Wataridori is NP-Complete
par: Ruangwises, Suthee
Publié: (2026)

Nondango is NP-Complete
par: Ruangwises, Suthee
Publié: (2023)

Evolomino is NP-complete
par: Nikolaev, Andrei V.
Publié: (2025)

Lions and Contamination: Trees and General Graphs
par: Kim, Dohoon, et autres
Publié: (2026)

Optimal Hardness of Online Algorithms for Large Common Induced Subgraphs
par: Gamarnik, David, et autres
Publié: (2026)

On a Hierarchy of Spectral Invariants for Graphs
par: Arvind, V., et autres
Publié: (2023)

Equality cases of the Stanley--Yan log-concave matroid inequality
par: Chan, Swee Hong, et autres
Publié: (2024)

A Note on the Complexity of Directed Clique
par: Gutowski, Grzegorz, et autres
Publié: (2026)

A combinatorial view of Holant problems on higher domains
par: Liu, Yin
Publié: (2024)

A near-optimal Quadratic Goldreich-Levin algorithm
par: Briët, Jop, et autres
Publié: (2025)

A Subexponential Reduction from Product Partition to Subset Sum
par: Costandin, Marius
Publié: (2024)

A criterion for Andrásfai--Erdős--Sós type theorems and applications
par: Hou, Jianfeng, et autres
Publié: (2024)

A Hypergraph Container Method on Spread SAT: Approximation and Speedup
par: Han, Zicheng, et autres
Publié: (2026)

Factorization norms and an inverse theorem for MaxCut
par: Balla, Igor, et autres
Publié: (2025)

Positivity of the symmetric group characters is as hard as the polynomial time hierarchy
par: Ikenmeyer, Christian, et autres
Publié: (2022)

A parameterized algorithm for $K_r$-factors in graphs of high minimum degree
par: Gan, Luyining, et autres
Publié: (2023)

NP-Completeness of Neighborhood Balanced Colorings
par: Asaeedi, Saeed
Publié: (2024)

The 2-Attractor Problem is NP-Complete
par: Fuchs, Janosch, et autres
Publié: (2023)

Carrying is Hard: Exploring the Gap between Hardness for NP and PSPACE for the Hanano and Jelly no Puzzles
par: Chavrimootoo, Michael C., et autres
Publié: (2026)

NP-Completeness of Multicast Beamforming in Wireless Communication
par: Shrestha, Sagar
Publié: (2025)

Low-Degree Polynomials Are Good Extractors
par: Alrabiah, Omar, et autres
Publié: (2024)

Improved Lower Bounds for all Odd-Query Locally Decodable Codes
par: Basu, Arpon, et autres
Publié: (2024)

On Approximability of Satisfiable $k$-CSPs: VI
par: Bhangale, Amey, et autres
Publié: (2024)

On Approximability of Satisfiable $k$-CSPs: VII
par: Bhangale, Amey, et autres
Publié: (2024)

Small Even Covers, Locally Decodable Codes and Restricted Subgraphs of Edge-Colored Kikuchi Graphs
par: Hsieh, Jun-Ting, et autres
Publié: (2024)

The Fine-Grained Complexity of Graph Homomorphism Problems: Towards the Okrasa and Rzążewski Conjecture
par: Baril, Ambroise, et autres
Publié: (2024)