The complexity of approximately counting in 2-spin systems on k-uniform bounded-degree hypergraphs

The complexity of approximately counting in 2-spin systems on k-uniform bounded-degree hypergraphs

Čájet eará veršuvnnaid (2)

One of the most important recent developments in the complexity of approximate counting is the classification of the complexity of approximating the partition functions of antiferromagnetic 2-spin systems on bounded-degree graphs. This classification is based on a beautiful connection to the so-call...

Bibliográfalaš dieđut
Váldodahkkit:	Goldberg, L, Galanis, A
Materiálatiipa:	Journal article
Almmustuhtton:	Elsevier 2016

Geahča maid

The complexity of approximately counting in 2-spin systems on k-uniform bounded-degree hypergraphs
Dahkki: Goldberg, L, et al.
Almmustuhtton: (2016)

The complexity of approximately counting in 2-spin systems on k-uniform bounded-degree hypergraphs
Dahkki: Galanis, A, et al.
Almmustuhtton: (2015)

Approximating partition functions of bounded- degree Boolean counting Constraint Satisfaction Problems
Dahkki: Galanis, A, et al.
Almmustuhtton: (2017)

Approximating partition functions of bounded-degree Boolean counting Constraint Satisfaction Problems
Dahkki: Galanis, A, et al.
Almmustuhtton: (2020)

The complexity of approximating the complex-valued Ising model on bounded degree graphs
Dahkki: Galanis, A, et al.
Almmustuhtton: (2022)

Inapproximability of counting hypergraph colourings
Dahkki: Galanis, A, et al.
Almmustuhtton: (2022)

On the distance energy of k-uniform hypergraphs
Dahkki: Sharma Kshitij, et al.
Almmustuhtton: (2023-07-01)

A complexity trichotomy for approximately counting list H-colourings
Dahkki: Goldberg, L, et al.
Almmustuhtton: (2016)

A complexity trichotomy for approximately counting list H-colourings
Dahkki: Galanis, A, et al.
Almmustuhtton: (2017)

Bounding the Number of Minimal Transversals in Tripartite 3-Uniform Hypergraphs
Dahkki: Alexandre Bazin, et al.
Almmustuhtton: (2023-04-01)

#BIS-hardness for 2-spin systems on bipartite bounded degree graphs in the tree non-uniqueness region
Dahkki: Goldberg, L, et al.
Almmustuhtton: (2015)

Self-complementing permutations of k-uniform hypergraphs
Dahkki: Artur Szymański, et al.
Almmustuhtton: (2009-01-01)

Super edge-magic labeling for 𝒌-uniform, complete 𝒌-uniform and complete 𝒌-uniform 𝒌-partite hypergraphs
Dahkki: Ratinan Boonklurb, et al.
Almmustuhtton: (2021-04-01)

Constructing and sampling partite, 3-uniform hypergraphs with given degree sequence.
Dahkki: András Hubai, et al.
Almmustuhtton: (2024-01-01)

Constructing and sampling partite, 3-uniform hypergraphs with given degree sequence
Dahkki: András Hubai, et al.
Almmustuhtton: (2024-01-01)

Approximately counting H-colourings is #BIS-hard
Dahkki: Galanis, A, et al.
Almmustuhtton: (2016)

Approximately counting H-colourings is BIS-Hard
Dahkki: Galanis, A, et al.
Almmustuhtton: (2015)

A generalization of Hall's theorem for $k$-uniform $k$-partite hypergraphs
Dahkki: Reza Jafarpour-Golzari
Almmustuhtton: (2019-09-01)

Sharp Bounds on the Spectral Radii of Uniform Hypergraphs concerning Diameter or Clique Number
Dahkki: Qiannan Niu, et al.
Almmustuhtton: (2021-01-01)

On the Sizes of (k, l)-Edge-Maximal r-Uniform Hypergraphs
Dahkki: Tian Yingzhi, et al.
Almmustuhtton: (2023-02-01)

On $\alpha$-spectral theory of a directed k-uniform hypergraph
Dahkki: Gholam-Hasan Shirdel, et al.
Almmustuhtton: (2020-09-01)

The complexity of approximately counting retractions
Dahkki: Focke, J, et al.
Almmustuhtton: (2020)

The complexity of approximately counting retractions
Dahkki: Focke, J, et al.
Almmustuhtton: (2019)

Hypergraphs of bounded disjointness
Dahkki: Scott, A, et al.
Almmustuhtton: (2014)

Bounds for the Energy of Hypergraphs
Dahkki: Liya Jess Kurian, et al.
Almmustuhtton: (2024-11-01)

A sharp upper bound on the spectral radius of a nonnegative k-uniform tensor and its applications to (directed) hypergraphs
Dahkki: Chuang Lv, et al.
Almmustuhtton: (2020-02-01)

A class of inequalities relating degrees of adjacent nodes to the average degree in edge-weighted uniform hypergraphs
Dahkki: P. D. Johnson, et al.
Almmustuhtton: (2005-01-01)

Sombor index of uniform hypergraphs
Dahkki: Xiuwen Wang, et al.
Almmustuhtton: (2024-10-01)

Bounds for the query complexity of approximate equilibria
Dahkki: Goldberg, PW, et al.
Almmustuhtton: (2016)

Decomposing hypergraphs into k-colorable hypergraphs
Dahkki: Gholamreza Omidi, et al.
Almmustuhtton: (2014-06-01)

The Average-Case Complexity of Counting Cliques in Erdös--Rényi Hypergraphs
Dahkki: Boix-Adserà, Enric, et al.
Almmustuhtton: (2022)

The Average-Case Complexity of Counting Cliques in Erdős-Rényi Hypergraphs
Dahkki: Boix-Adsera, Enric, et al.
Almmustuhtton: (2021)

On rainbow-free colourings of uniform hypergraphs
Dahkki: Groot Koerkamp, R, et al.
Almmustuhtton: (2021)

On hamiltonian chain saturated uniform hypergraphs
Dahkki: Aneta Dudek, et al.
Almmustuhtton: (2012-01-01)

On the α-Spectral Radius of Uniform Hypergraphs
Dahkki: Guo Haiyan, et al.
Almmustuhtton: (2020-05-01)

A Note on Packing of Uniform Hypergraphs
Dahkki: Konarski Jerzy, et al.
Almmustuhtton: (2022-11-01)

Almost Self-Complementary Uniform Hypergraphs
Dahkki: Wojda Adam Paweł
Almmustuhtton: (2018-05-01)

On vertex independence number of uniform hypergraphs
Dahkki: Chishti Tariq A., et al.
Almmustuhtton: (2014-06-01)

Decomposing complete 3-uniform hypergraph K_{n}^{(3)} into 7-cycles
Dahkki: Meihua, et al.
Almmustuhtton: (2019-01-01)

Fast sampling via spectral independence beyond bounded-degree graphs
Dahkki: Bezáková, I, et al.
Almmustuhtton: (2024)