Symmetric Parameterised Holants on Hypergraphs: Towards a Classification for Parameterised VCSPs
Fuente:
arXiv
Saved in:
| Main Authors: | Aivasiliotis, Panagiotis, Göbel, Andreas, Roth, Marc |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Parameterised Holant Problems
by: Aivasiliotis, Panagiotis, et al.
Published: (2024)
by: Aivasiliotis, Panagiotis, et al.
Published: (2024)
Parameterised distance to local irregularity
by: Fioravantes, Foivos, et al.
Published: (2023)
by: Fioravantes, Foivos, et al.
Published: (2023)
FPT Parameterisations of Fractional and Generalised Hypertree Width
by: Lanzinger, Matthias, et al.
Published: (2025)
by: Lanzinger, Matthias, et al.
Published: (2025)
Parameterised Complexity of Consistent Query Answering via Graph Representations
by: Hankala, Teemu, et al.
Published: (2024)
by: Hankala, Teemu, et al.
Published: (2024)
Space Efficient Algorithms for Parameterised Problems
by: Akhtar, Sheikh Shakil, et al.
Published: (2025)
by: Akhtar, Sheikh Shakil, et al.
Published: (2025)
A Note on the Parameterised Complexity of Coverability in Vector Addition Systems
by: Pilipczuk, Michał, et al.
Published: (2025)
by: Pilipczuk, Michał, et al.
Published: (2025)
From an odd arity signature to a Holant dichotomy
by: Meng, Boning, et al.
Published: (2025)
by: Meng, Boning, et al.
Published: (2025)
Holant* Dichotomy on Domain Size 3: A Geometric Perspective
by: Cai, Jin-Yi, et al.
Published: (2025)
by: Cai, Jin-Yi, et al.
Published: (2025)
A combinatorial view of Holant problems on higher domains
by: Liu, Yin
Published: (2024)
by: Liu, Yin
Published: (2024)
A full dichotomy for Holant$^c$, inspired by quantum computation
by: Backens, Miriam
Published: (2022)
by: Backens, Miriam
Published: (2022)
The Complexity of Counting Small Sub-Hypergraphs
by: Bressan, Marco, et al.
Published: (2025)
by: Bressan, Marco, et al.
Published: (2025)
Perfect sampling from rapidly mixing Markov chains
by: Göbel, Andreas, et al.
Published: (2024)
by: Göbel, Andreas, et al.
Published: (2024)
Hardness of Hypergraph Edge Modification Problems
by: Gishboliner, Lior, et al.
Published: (2025)
by: Gishboliner, Lior, et al.
Published: (2025)
Bisection Width, Discrepancy, and Eigenvalues of Hypergraphs
by: Räty, Eero, et al.
Published: (2024)
by: Räty, Eero, et al.
Published: (2024)
From Alternation to FPRAS: Toward a Complexity Classification of Approximate Counting
by: Hecher, Markus, et al.
Published: (2025)
by: Hecher, Markus, et al.
Published: (2025)
Symmetric Distributions from Shallow Circuits
by: Kane, Daniel M., et al.
Published: (2025)
by: Kane, Daniel M., et al.
Published: (2025)
Symmetric Algebraic Circuits and Homomorphism Polynomials
by: Dawar, Anuj, et al.
Published: (2025)
by: Dawar, Anuj, et al.
Published: (2025)
Locally Sampleable Uniform Symmetric Distributions
by: Kane, Daniel M., et al.
Published: (2024)
by: Kane, Daniel M., et al.
Published: (2024)
Computing the Elementary Symmetric Polynomials in Positive Characteristics
by: Orzel, Ian
Published: (2025)
by: Orzel, Ian
Published: (2025)
On the Principal Minor Expansion and Complexity of the Symmetrized Determinant
by: Agarwal, Sanyam, et al.
Published: (2026)
by: Agarwal, Sanyam, et al.
Published: (2026)
Property Testing in Bounded Degree Hypergraphs
by: Aaronson, Hugo, et al.
Published: (2025)
by: Aaronson, Hugo, et al.
Published: (2025)
A Hypergraph Container Method on Spread SAT: Approximation and Speedup
by: Han, Zicheng, et al.
Published: (2026)
by: Han, Zicheng, et al.
Published: (2026)
On the Bit Size of Sum-of-Squares Proofs for Symmetric Formulations
by: Bortolotti, Alex, et al.
Published: (2025)
by: Bortolotti, Alex, et al.
Published: (2025)
Quantum k-SAT Related Hypergraph Problems
by: Kremer, Simon-Luca, et al.
Published: (2025)
by: Kremer, Simon-Luca, et al.
Published: (2025)
Exponential-Size Circuit Complexity is Comeager in Symmetric Exponential Time
by: Hitchcock, John M.
Published: (2026)
by: Hitchcock, John M.
Published: (2026)
Counting Subgraphs in Somewhere Dense Graphs
by: Bressan, Marco, et al.
Published: (2022)
by: Bressan, Marco, et al.
Published: (2022)
Symmetric quantum computation
by: Castro-Silva, Davi, et al.
Published: (2025)
by: Castro-Silva, Davi, et al.
Published: (2025)
Upper Bounds for Symmetric Approximate Bounded Indistinguishability
by: Williamson, Christopher
Published: (2026)
by: Williamson, Christopher
Published: (2026)
Symmetric Exponential Time Requires Near-Maximum Circuit Size: Simplified, Truly Uniform
by: Li, Zeyong
Published: (2023)
by: Li, Zeyong
Published: (2023)
Pointer Chasing with Unlimited Interaction
by: Fischer, Orr, et al.
Published: (2025)
by: Fischer, Orr, et al.
Published: (2025)
Symmetric Proofs in the Ideal Proof System
by: Dawar, Anuj, et al.
Published: (2025)
by: Dawar, Anuj, et al.
Published: (2025)
Efficient Generation of Parameterised Quantum Circuits from Large Texts
by: Krawchuk, Colin, et al.
Published: (2025)
by: Krawchuk, Colin, et al.
Published: (2025)
Approximately Counting Answers to Conjunctive Queries with Disequalities and Negations
by: Focke, Jacob, et al.
Published: (2021)
by: Focke, Jacob, et al.
Published: (2021)
On the Complexity of Hyperpath and Minimal Separator Enumeration in Directed Hypergraphs
by: Kurita, Kazuhiro, et al.
Published: (2025)
by: Kurita, Kazuhiro, et al.
Published: (2025)
Optimal Lower Bounds for Symmetric Modular Circuits
by: Pago, Benedikt
Published: (2026)
by: Pago, Benedikt
Published: (2026)
Exploring VASS Parameterised by Geometric Dimension
by: Czerwiński, Wojciech, et al.
Published: (2026)
by: Czerwiński, Wojciech, et al.
Published: (2026)
Sparsity-Parameterised Dynamic Edge Colouring
by: Christiansen, Aleksander B. G., et al.
Published: (2023)
by: Christiansen, Aleksander B. G., et al.
Published: (2023)
Path-Parameterised RRTs for Underactuated Systems
by: Abood, Damian, et al.
Published: (2024)
by: Abood, Damian, et al.
Published: (2024)
Equivalence Checking of Parameterised Quantum Circuits
by: Hong, Xin, et al.
Published: (2024)
by: Hong, Xin, et al.
Published: (2024)
Hypergraph Samplers: Typical and Worst Case Behavior
by: Alev, Vedat Levi, et al.
Published: (2026)
by: Alev, Vedat Levi, et al.
Published: (2026)
Similar Items
-
Parameterised Holant Problems
by: Aivasiliotis, Panagiotis, et al.
Published: (2024) -
Parameterised distance to local irregularity
by: Fioravantes, Foivos, et al.
Published: (2023) -
FPT Parameterisations of Fractional and Generalised Hypertree Width
by: Lanzinger, Matthias, et al.
Published: (2025) -
Parameterised Complexity of Consistent Query Answering via Graph Representations
by: Hankala, Teemu, et al.
Published: (2024) -
Space Efficient Algorithms for Parameterised Problems
by: Akhtar, Sheikh Shakil, et al.
Published: (2025)