Imagen de Portada

Parameterised Holant Problems

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Aivasiliotis, Panagiotis, Göbel, Andreas, Roth, Marc, Schmitt, Johannes
Formato:	Preprint
Publicado:	2024
Materias:	Computational Complexity Combinatorics
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Symmetric Parameterised Holants on Hypergraphs: Towards a Classification for Parameterised VCSPs
por: Aivasiliotis, Panagiotis, et al.
Publicado: (2025)

A combinatorial view of Holant problems on higher domains
por: Liu, Yin
Publicado: (2024)

Space Efficient Algorithms for Parameterised Problems
por: Akhtar, Sheikh Shakil, et al.
Publicado: (2025)

Hardness of Hypergraph Edge Modification Problems
por: Gishboliner, Lior, et al.
Publicado: (2025)

The Rank-Ramsey Problem and the Log-Rank Conjecture
por: Beniamini, Gal, et al.
Publicado: (2024)

On Computational Aspects of Ordered Matching Problems
por: Čertík, Michal, et al.
Publicado: (2025)

On Degeneracy in the P-Matroid Oriented Matroid Complementarity Problem
por: Borzechowski, Michaela, et al.
Publicado: (2023)

The Complexity Classes of Hamming Distance Recoverable Robust Problems
por: Grüne, Christoph
Publicado: (2022)

King Chasing Problem in Chinese Chess is NP-hard
por: Li, Chao, et al.
Publicado: (2026)

The Fine-Grained Complexity of Graph Homomorphism Problems: Towards the Okrasa and Rzążewski Conjecture
por: Baril, Ambroise, et al.
Publicado: (2024)

On a Hierarchy of Spectral Invariants for Graphs
por: Arvind, V., et al.
Publicado: (2023)

Completeness in the Polynomial Hierarchy and PSPACE for many natural problems derived from NP
por: Grüne, Christoph, et al.
Publicado: (2026)

From an odd arity signature to a Holant dichotomy
por: Meng, Boning, et al.
Publicado: (2025)

Holant* Dichotomy on Domain Size 3: A Geometric Perspective
por: Cai, Jin-Yi, et al.
Publicado: (2025)

The Subgraph Isomorphism Problem for Port Graphs and Quantum Circuits
por: Mondada, Luca, et al.
Publicado: (2023)

Learning Read-Once Determinants and the Principal Minor Assignment Problem
por: Aravind, Abhiram, et al.
Publicado: (2026)

A SAT Solver and Computer Algebra Attack on the Minimum Kochen-Specker Problem
por: Li, Zhengyu, et al.
Publicado: (2023)

Kernelization Complexity of Solution Discovery Problems
por: Grobler, Mario, et al.
Publicado: (2024)

Low-Degree Polynomials Are Good Extractors
por: Alrabiah, Omar, et al.
Publicado: (2024)

Improved Lower Bounds for all Odd-Query Locally Decodable Codes
por: Basu, Arpon, et al.
Publicado: (2024)

On Approximability of Satisfiable $k$-CSPs: VI
por: Bhangale, Amey, et al.
Publicado: (2024)

On Approximability of Satisfiable $k$-CSPs: VII
por: Bhangale, Amey, et al.
Publicado: (2024)

Small Even Covers, Locally Decodable Codes and Restricted Subgraphs of Edge-Colored Kikuchi Graphs
por: Hsieh, Jun-Ting, et al.
Publicado: (2024)

A Subexponential Reduction from Product Partition to Subset Sum
por: Costandin, Marius
Publicado: (2024)

Constant Degree Direct Product Testers with Small Soundness
por: Bafna, Mitali, et al.
Publicado: (2024)

A criterion for Andrásfai--Erdős--Sós type theorems and applications
por: Hou, Jianfeng, et al.
Publicado: (2024)

Bisection Width, Discrepancy, and Eigenvalues of Hypergraphs
por: Räty, Eero, et al.
Publicado: (2024)

Corners in Quasirandom Groups via Sparse Mixing
por: Jaber, Michael, et al.
Publicado: (2024)

Reasonable Bounds for Combinatorial Lines of Length Three
por: Bhangale, Amey, et al.
Publicado: (2024)

Boosting uniformity in quasirandom groups: fast and simple
por: Derksen, Harm, et al.
Publicado: (2024)

Approximately counting maximal independent set is equivalent to #SAT
por: Zhang, Hao, et al.
Publicado: (2024)

Two-Source and Affine Non-Malleable Extractors for Small Entropy
por: Li, Xin, et al.
Publicado: (2024)

Computing eulerian magnitude homology
por: Menara, Giuliamaria, et al.
Publicado: (2024)

On the Nature and Complexity of an Impartial Two-Player Variant of the Game Lights-Out
por: Fiorini, Eugene, et al.
Publicado: (2024)

On the Structure of Hamiltonian Graphs with Small Independence Number
por: Jedličková, Nikola, et al.
Publicado: (2024)

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

$C_{2k+1}$-coloring of bounded-diameter graphs
por: Piecyk, Marta
Publicado: (2024)

Complexity Framework For Forbidden Subgraphs V: Beyond Simple Graphs
por: Eagling-Vose, Tala, et al.
Publicado: (2025)

Refuting Perfect Matchings in Spectral Expanders is Hard
por: Biswas, Ari, et al.
Publicado: (2025)

A Note on the Complexity of Directed Clique
por: Gutowski, Grzegorz, et al.
Publicado: (2026)