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

Taispeáin leaganacha eile (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...

Cur síos iomlán

Sonraí bibleagrafaíochta
Príomhchruthaitheoirí:	Goldberg, L, Galanis, A
Formáid:	Journal article
Foilsithe / Cruthaithe:	Elsevier 2016

Míreanna comhchosúla

The complexity of approximately counting in 2-spin systems on k-uniform bounded-degree hypergraphs
de réir: Goldberg, L, et al.
Foilsithe / Cruthaithe: (2016)

The complexity of approximately counting in 2-spin systems on k-uniform bounded-degree hypergraphs
de réir: Galanis, A, et al.
Foilsithe / Cruthaithe: (2015)

Approximating partition functions of bounded- degree Boolean counting Constraint Satisfaction Problems
de réir: Galanis, A, et al.
Foilsithe / Cruthaithe: (2017)

Approximating partition functions of bounded-degree Boolean counting Constraint Satisfaction Problems
de réir: Galanis, A, et al.
Foilsithe / Cruthaithe: (2020)

The complexity of approximating the complex-valued Ising model on bounded degree graphs
de réir: Galanis, A, et al.
Foilsithe / Cruthaithe: (2022)

Inapproximability of counting hypergraph colourings
de réir: Galanis, A, et al.
Foilsithe / Cruthaithe: (2022)

On the distance energy of k-uniform hypergraphs
de réir: Sharma Kshitij, et al.
Foilsithe / Cruthaithe: (2023-07-01)

A complexity trichotomy for approximately counting list H-colourings
de réir: Goldberg, L, et al.
Foilsithe / Cruthaithe: (2016)

A complexity trichotomy for approximately counting list H-colourings
de réir: Galanis, A, et al.
Foilsithe / Cruthaithe: (2017)

Bounding the Number of Minimal Transversals in Tripartite 3-Uniform Hypergraphs
de réir: Alexandre Bazin, et al.
Foilsithe / Cruthaithe: (2023-04-01)

#BIS-hardness for 2-spin systems on bipartite bounded degree graphs in the tree non-uniqueness region
de réir: Goldberg, L, et al.
Foilsithe / Cruthaithe: (2015)

Self-complementing permutations of k-uniform hypergraphs
de réir: Artur Szymański, et al.
Foilsithe / Cruthaithe: (2009-01-01)

Super edge-magic labeling for 𝒌-uniform, complete 𝒌-uniform and complete 𝒌-uniform 𝒌-partite hypergraphs
de réir: Ratinan Boonklurb, et al.
Foilsithe / Cruthaithe: (2021-04-01)

Constructing and sampling partite, 3-uniform hypergraphs with given degree sequence.
de réir: András Hubai, et al.
Foilsithe / Cruthaithe: (2024-01-01)

Constructing and sampling partite, 3-uniform hypergraphs with given degree sequence
de réir: András Hubai, et al.
Foilsithe / Cruthaithe: (2024-01-01)

Approximately counting H-colourings is #BIS-hard
de réir: Galanis, A, et al.
Foilsithe / Cruthaithe: (2016)

Approximately counting H-colourings is BIS-Hard
de réir: Galanis, A, et al.
Foilsithe / Cruthaithe: (2015)

A generalization of Hall's theorem for $k$-uniform $k$-partite hypergraphs
de réir: Reza Jafarpour-Golzari
Foilsithe / Cruthaithe: (2019-09-01)

Sharp Bounds on the Spectral Radii of Uniform Hypergraphs concerning Diameter or Clique Number
de réir: Qiannan Niu, et al.
Foilsithe / Cruthaithe: (2021-01-01)

On the Sizes of (k, l)-Edge-Maximal r-Uniform Hypergraphs
de réir: Tian Yingzhi, et al.
Foilsithe / Cruthaithe: (2023-02-01)

On $\alpha$-spectral theory of a directed k-uniform hypergraph
de réir: Gholam-Hasan Shirdel, et al.
Foilsithe / Cruthaithe: (2020-09-01)

The complexity of approximately counting retractions
de réir: Focke, J, et al.
Foilsithe / Cruthaithe: (2020)

The complexity of approximately counting retractions
de réir: Focke, J, et al.
Foilsithe / Cruthaithe: (2019)

Hypergraphs of bounded disjointness
de réir: Scott, A, et al.
Foilsithe / Cruthaithe: (2014)

Bounds for the Energy of Hypergraphs
de réir: Liya Jess Kurian, et al.
Foilsithe / Cruthaithe: (2024-11-01)

A sharp upper bound on the spectral radius of a nonnegative k-uniform tensor and its applications to (directed) hypergraphs
de réir: Chuang Lv, et al.
Foilsithe / Cruthaithe: (2020-02-01)

A class of inequalities relating degrees of adjacent nodes to the average degree in edge-weighted uniform hypergraphs
de réir: P. D. Johnson, et al.
Foilsithe / Cruthaithe: (2005-01-01)

Sombor index of uniform hypergraphs
de réir: Xiuwen Wang, et al.
Foilsithe / Cruthaithe: (2024-10-01)

Bounds for the query complexity of approximate equilibria
de réir: Goldberg, PW, et al.
Foilsithe / Cruthaithe: (2016)

Decomposing hypergraphs into k-colorable hypergraphs
de réir: Gholamreza Omidi, et al.
Foilsithe / Cruthaithe: (2014-06-01)

The Average-Case Complexity of Counting Cliques in Erdös--Rényi Hypergraphs
de réir: Boix-Adserà, Enric, et al.
Foilsithe / Cruthaithe: (2022)

The Average-Case Complexity of Counting Cliques in Erdős-Rényi Hypergraphs
de réir: Boix-Adsera, Enric, et al.
Foilsithe / Cruthaithe: (2021)

On rainbow-free colourings of uniform hypergraphs
de réir: Groot Koerkamp, R, et al.
Foilsithe / Cruthaithe: (2021)

On hamiltonian chain saturated uniform hypergraphs
de réir: Aneta Dudek, et al.
Foilsithe / Cruthaithe: (2012-01-01)

On the α-Spectral Radius of Uniform Hypergraphs
de réir: Guo Haiyan, et al.
Foilsithe / Cruthaithe: (2020-05-01)

A Note on Packing of Uniform Hypergraphs
de réir: Konarski Jerzy, et al.
Foilsithe / Cruthaithe: (2022-11-01)

Almost Self-Complementary Uniform Hypergraphs
de réir: Wojda Adam Paweł
Foilsithe / Cruthaithe: (2018-05-01)

On vertex independence number of uniform hypergraphs
de réir: Chishti Tariq A., et al.
Foilsithe / Cruthaithe: (2014-06-01)

Decomposing complete 3-uniform hypergraph K_{n}^{(3)} into 7-cycles
de réir: Meihua, et al.
Foilsithe / Cruthaithe: (2019-01-01)

Fast sampling via spectral independence beyond bounded-degree graphs
de réir: Bezáková, I, et al.
Foilsithe / Cruthaithe: (2024)