Imagen de Portada

Computational Complexity and Integer Programming Formulation of the Oredango Puzzle

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Takahata, Takuma, Minamikawa, Norito, Okuno, Takayuki
Formato:	Preprint
Publicado:	2025
Materias:	Computational Complexity
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Complexity of 2D Snake Cube Puzzles
por: MIT Hardness Group, et al.
Publicado: (2024)

Automatizing Software Cognitive Complexity Reduction through Integer Linear Programming
por: Saborido, Rubén, et al.
Publicado: (2024)

Tight Lower Bounds for Block-Structured Integer Programs
por: Hunkenschröder, Christoph, et al.
Publicado: (2024)

Parameterized Algorithms for Matching Integer Programs with Additional Rows and Columns
por: Lassota, Alexandra, et al.
Publicado: (2025)

The Complexity of Computing KKT Solutions of Quadratic Programs
por: Fearnley, John, et al.
Publicado: (2023)

Permutation Match Puzzles: How Young Tanvi Learned About Computational Complexity
por: Gajjar, Kshitij, et al.
Publicado: (2026)

Solving 4-Block Integer Linear Programs Faster Using Affine Decompositions of the Right-Hand Sides
por: Lassota, Alexandra, et al.
Publicado: (2026)

Random Permutations in Computational Complexity
por: Hitchcock, John M., et al.
Publicado: (2025)

The Radical Solution and Computational Complexity
por: Zheng, Bojin, et al.
Publicado: (2024)

The Computational Complexity of Factored Graphs
por: Gupta, Shreya, et al.
Publicado: (2024)

Fine-Grained Equivalence for Problems Related to Integer Linear Programming
por: Rohwedder, Lars, et al.
Publicado: (2024)

Prime Successor Irreducibility: Turing Machine Complexity, Kolmogorov Complexity, and Weakness-Based Formulations
por: Goertzel, Ben, et al.
Publicado: (2026)

Computational Complexity of Game Boy Games
por: Tirmazi, Hayder, et al.
Publicado: (2024)

Complex Boolean Turing Machines: An Algebraic Semantic Framework for Computational Complexity
por: Zheng, Bojin, et al.
Publicado: (2026)

Information-Based Complexity vs Computational Complexity in Phaseless Polynomial Interpolation
por: Przybyłek, Michał R., et al.
Publicado: (2026)

Tensor Ranks and the Fine-Grained Complexity of Dynamic Programming
por: Alman, Josh, et al.
Publicado: (2023)

The Parameterized Complexity of Computing the Linear Vertex Arboricity
por: Erhardt, Alexander, et al.
Publicado: (2025)

Assembly Theory and its Relationship with Computational Complexity
por: Kempes, Christopher P., et al.
Publicado: (2024)

An Overview of the Theory of Instances Computational Complexity
por: Jorge A. Ruiz-Vanoye
Publicado: (2011)

Carrying is Hard: Exploring the Gap between Hardness for NP and PSPACE for the Hanano and Jelly no Puzzles
por: Chavrimootoo, Michael C., et al.
Publicado: (2026)

A Note on the Complexity of Bilevel Linear Programs in Fixed Dimensions
por: Ketkov, Sergey S., et al.
Publicado: (2025)

Scheme-Theoretic Approach to Computational Complexity. III. SETH
por: Çivril, Ali
Publicado: (2023)

Limitations of Affine Integer Relaxations for Solving Constraint Satisfaction Problems
por: Lichter, Moritz, et al.
Publicado: (2024)

Computational Complexity of UAP Reverse Engineering: A Formal Analysis of Automaton Identification and Data Complexity
por: Daghbouche, Karim
Publicado: (2025)

Integer Programming Using A Single Atom
por: Goswami, Kapil, et al.
Publicado: (2024)

A Smoothed Analysis of the Space Complexity of Computing a Chaotic Sequence
por: Okada, Naoaki, et al.
Publicado: (2024)

Scheme-theoretic Approach to Computational Complexity I. The Separation of P and NP
por: Çivril, Ali
Publicado: (2021)

Computational Complexity of the Recoverable Robust Shortest Path Problem with Discrete Recourse
por: Jackiewicz, Marcel, et al.
Publicado: (2024)

On the Bit Size of Sum-of-Squares Proofs for Symmetric Formulations
por: Bortolotti, Alex, et al.
Publicado: (2025)

On the Complexity of p-Order Cone Programs
por: Blanco, Víctor, et al.
Publicado: (2025)

Parks: A Doubly Infinite Family of NP-Complete Puzzles and Generalizations of A002464
por: Minevich, Igor, et al.
Publicado: (2024)

Bosonic Quantum Computational Complexity
por: Chabaud, Ulysse, et al.
Publicado: (2024)

Counterfactual Explanations for Integer Optimization Problems
por: Engelhardt, Felix, et al.
Publicado: (2025)

Scheme-Theoretic Approach to Computational Complexity. IV. A New Perspective on Hardness of Approximation
por: Çivril, Ali
Publicado: (2023)

NP-Completeness Proofs of Puzzles using the T-Metacell Framework
por: Kiatchaipipat, Nattapol, et al.
Publicado: (2025)

The Log-Rank Conjecture: New Equivalent Formulations
por: Hambardzumyan, Lianna, et al.
Publicado: (2025)

The Computational Complexity of the Housing Market
por: Lock, Edwin, et al.
Publicado: (2024)

ASP-Completeness of Hamiltonicity in Grid Graphs, with Applications to Loop Puzzles
por: MIT Hardness Group, et al.
Publicado: (2024)

Computational Complexity in Property Testing
por: Pinto Jr., Renato Ferreira, et al.
Publicado: (2025)

Computational Complexities of Folding
por: Eppstein, David
Publicado: (2024)