Imagen de Portada

Complexity of chess domination problems

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Langlois-Rémillard, Alexis, Müßig, Mia, Róldan, Érika
Formato:	Preprint
Publicado:	2022
Materias:	Combinatorics Computational Complexity Computational Geometry Discrete Mathematics 03D15, 05B40, 05B50, 00A08, 68Q17, 68R05, 68R07
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Insights from a workshop on gamification of research in mathematics and computer science
por: Langlois-Rémillard, Alexis, et al.
Publicado: (2024)

Solution Numbers for Eight Blocks to Madness Puzzle
por: Johnson, Inga, et al.
Publicado: (2024)

A Study of NP-Completeness and Undecidable Word Problems in Semigroups
por: Abdullah, Duaa, et al.
Publicado: (2025)

Trifferent codes with small lengths
por: Kurz, Sascha
Publicado: (2023)

Refutation of Spectral Graph Theory Conjectures with Search Algorithms)
por: Roucairol, Milo, et al.
Publicado: (2024)

Complexity of Sequence-to-Graph Alignment with Co-Linear Chaining
por: Li, Xingfu
Publicado: (2026)

Computational complexity of counting coincidences
por: Chan, Swee Hong, et al.
Publicado: (2023)

Orthogonal Latin Squares of Order Ten with Two Relations: A SAT Investigation
por: Bright, Curtis, et al.
Publicado: (2025)

Myrvold's Results on Orthogonal Triples of $10 \times 10$ Latin Squares: A SAT Investigation
por: Bright, Curtis, et al.
Publicado: (2025)

Linear extensions of finite posets
por: Chan, Swee Hong, et al.
Publicado: (2023)

Regenerative Ulam-von Neumann Algorithm: An Innovative Markov chain Monte Carlo Method for Matrix Inversion
por: Ghosh, Soumyadip, et al.
Publicado: (2024)

Flexible constraint satisfiability and a problem in semigroup theory
por: Jackson, Marcel
Publicado: (2015)

The random $k$-SAT Gibbs uniqueness threshold revisited
por: Chatterjee, Arnab, et al.
Publicado: (2025)

Folding One Polyhedral Metric Graph into Another
por: Chung, Lily, et al.
Publicado: (2024)

Results on three problems on isolation of graphs
por: Borg, Peter, et al.
Publicado: (2026)

Finite model theory for pseudovarieties and universal algebra: preservation, definability and complexity
por: Ham, Lucy, et al.
Publicado: (2022)

Perfecting the Line Graph
por: Bal, Hartosh Singh
Publicado: (2025)

Generalisations of Matrix Partitions : Complexity and Obstructions
por: Barsukov, Alexey, et al.
Publicado: (2021)

Polynomial-Time Solutions for Longest Common Subsequence Related Problems Between a Sequence and a Pangenome Graph
por: Li, Xingfu, et al.
Publicado: (2026)

Greedy Matchings in Bipartite Graphs with Ordered Vertex Sets
por: Simon, Hans U.
Publicado: (2024)

Optimal Hardness of Online Algorithms for Large Independent Sets
por: Gamarnik, David, et al.
Publicado: (2025)

Equality cases of the Alexandrov--Fenchel inequality are not in the polynomial hierarchy
por: Chan, Swee Hong, et al.
Publicado: (2023)

The Gallai Vertex Problem is $Θ_2^p$-Complete
por: Nikabadi, Amir, et al.
Publicado: (2026)

Graphs whose vertices of degree at least 2 lie in a triangle
por: Forte, Vinicius L. do, et al.
Publicado: (2022)

Edge-coloring problems with forbidden patterns and planted colors
por: Barsukov, Alexey, et al.
Publicado: (2025)

Asymptotic Analysis of q-Recursive Sequences
por: Heuberger, Clemens, et al.
Publicado: (2021)

String attractors of some simple-Parry automatic sequences
por: Gheeraert, France, et al.
Publicado: (2023)

An efficient algorithm for generating transmission irregular trees
por: Stošić, Ivan, et al.
Publicado: (2025)

#P is Sandwiched by One and Two #2DNF Calls: Is Subtraction Stronger Than We Thought?
por: Bannach, Max, et al.
Publicado: (2025)

Undecidability of the block gluing classes of homshifts
por: Chandgotia, Nishant, et al.
Publicado: (2025)

Tight eigenvalue bound on the traveling salesman problem
por: Wolff, Lasse H.
Publicado: (2025)

Relative position in binary substitutions
por: Coons, Michael, et al.
Publicado: (2024)

A Note on Small Percolating Sets on Hypercubes via Generative AI
por: Bérczi, Gergely, et al.
Publicado: (2024)

A polynomial-time algorithm for deciding the Hilbert Nullstellensatz over $\mathbb{Z}_2$. A proof of $\mathbf{P}=\mathbf{NP}$ hypothesis
por: Petrov, Petar P.
Publicado: (2022)

Complexity and algorithms for Swap median and relation to other consensus problems
por: Cunha, Luís, et al.
Publicado: (2024)

Degree Realization by Bipartite Multigraphs
por: Bar-Noy, Amotz, et al.
Publicado: (2025)

Word-Representability of Graphs with respect to Split Recomposition
por: Dwary, Tithi, et al.
Publicado: (2024)

Continuous Flattening and Reversing of Convex Polyhedral Linkages
por: Demaine, Erik D., et al.
Publicado: (2024)

Universal partial tori
por: Carey, William D., et al.
Publicado: (2024)

Bounds on Codes Correcting Transpositions of Consecutive Symbols
por: Kovačević, Mladen, et al.
Publicado: (2025)