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

Εμφάνιση άλλων εκδόσεων (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...

Πλήρης περιγραφή

Λεπτομέρειες βιβλιογραφικής εγγραφής
Κύριοι συγγραφείς:	Goldberg, L, Galanis, A
Μορφή:	Journal article
Έκδοση:	Elsevier 2016

Παρόμοια τεκμήρια

The complexity of approximately counting in 2-spin systems on k-uniform bounded-degree hypergraphs
ανά: Goldberg, L, κ.ά.
Έκδοση: (2016)

The complexity of approximately counting in 2-spin systems on k-uniform bounded-degree hypergraphs
ανά: Galanis, A, κ.ά.
Έκδοση: (2015)

Approximating partition functions of bounded- degree Boolean counting Constraint Satisfaction Problems
ανά: Galanis, A, κ.ά.
Έκδοση: (2017)

Approximating partition functions of bounded-degree Boolean counting Constraint Satisfaction Problems
ανά: Galanis, A, κ.ά.
Έκδοση: (2020)

The complexity of approximating the complex-valued Ising model on bounded degree graphs
ανά: Galanis, A, κ.ά.
Έκδοση: (2022)

Inapproximability of counting hypergraph colourings
ανά: Galanis, A, κ.ά.
Έκδοση: (2022)

On the distance energy of k-uniform hypergraphs
ανά: Sharma Kshitij, κ.ά.
Έκδοση: (2023-07-01)

A complexity trichotomy for approximately counting list H-colourings
ανά: Goldberg, L, κ.ά.
Έκδοση: (2016)

A complexity trichotomy for approximately counting list H-colourings
ανά: Galanis, A, κ.ά.
Έκδοση: (2017)

Bounding the Number of Minimal Transversals in Tripartite 3-Uniform Hypergraphs
ανά: Alexandre Bazin, κ.ά.
Έκδοση: (2023-04-01)

#BIS-hardness for 2-spin systems on bipartite bounded degree graphs in the tree non-uniqueness region
ανά: Goldberg, L, κ.ά.
Έκδοση: (2015)

Self-complementing permutations of k-uniform hypergraphs
ανά: Artur Szymański, κ.ά.
Έκδοση: (2009-01-01)

Super edge-magic labeling for 𝒌-uniform, complete 𝒌-uniform and complete 𝒌-uniform 𝒌-partite hypergraphs
ανά: Ratinan Boonklurb, κ.ά.
Έκδοση: (2021-04-01)

Constructing and sampling partite, 3-uniform hypergraphs with given degree sequence.
ανά: András Hubai, κ.ά.
Έκδοση: (2024-01-01)

Constructing and sampling partite, 3-uniform hypergraphs with given degree sequence
ανά: András Hubai, κ.ά.
Έκδοση: (2024-01-01)

Approximately counting H-colourings is #BIS-hard
ανά: Galanis, A, κ.ά.
Έκδοση: (2016)

Approximately counting H-colourings is BIS-Hard
ανά: Galanis, A, κ.ά.
Έκδοση: (2015)

A generalization of Hall's theorem for $k$-uniform $k$-partite hypergraphs
ανά: Reza Jafarpour-Golzari
Έκδοση: (2019-09-01)

Sharp Bounds on the Spectral Radii of Uniform Hypergraphs concerning Diameter or Clique Number
ανά: Qiannan Niu, κ.ά.
Έκδοση: (2021-01-01)

On the Sizes of (k, l)-Edge-Maximal r-Uniform Hypergraphs
ανά: Tian Yingzhi, κ.ά.
Έκδοση: (2023-02-01)

On $\alpha$-spectral theory of a directed k-uniform hypergraph
ανά: Gholam-Hasan Shirdel, κ.ά.
Έκδοση: (2020-09-01)

The complexity of approximately counting retractions
ανά: Focke, J, κ.ά.
Έκδοση: (2020)

The complexity of approximately counting retractions
ανά: Focke, J, κ.ά.
Έκδοση: (2019)

Hypergraphs of bounded disjointness
ανά: Scott, A, κ.ά.
Έκδοση: (2014)

Bounds for the Energy of Hypergraphs
ανά: Liya Jess Kurian, κ.ά.
Έκδοση: (2024-11-01)

A sharp upper bound on the spectral radius of a nonnegative k-uniform tensor and its applications to (directed) hypergraphs
ανά: Chuang Lv, κ.ά.
Έκδοση: (2020-02-01)

A class of inequalities relating degrees of adjacent nodes to the average degree in edge-weighted uniform hypergraphs
ανά: P. D. Johnson, κ.ά.
Έκδοση: (2005-01-01)

Sombor index of uniform hypergraphs
ανά: Xiuwen Wang, κ.ά.
Έκδοση: (2024-10-01)

Bounds for the query complexity of approximate equilibria
ανά: Goldberg, PW, κ.ά.
Έκδοση: (2016)

Decomposing hypergraphs into k-colorable hypergraphs
ανά: Gholamreza Omidi, κ.ά.
Έκδοση: (2014-06-01)

The Average-Case Complexity of Counting Cliques in Erdös--Rényi Hypergraphs
ανά: Boix-Adserà, Enric, κ.ά.
Έκδοση: (2022)

The Average-Case Complexity of Counting Cliques in Erdős-Rényi Hypergraphs
ανά: Boix-Adsera, Enric, κ.ά.
Έκδοση: (2021)

On rainbow-free colourings of uniform hypergraphs
ανά: Groot Koerkamp, R, κ.ά.
Έκδοση: (2021)

On hamiltonian chain saturated uniform hypergraphs
ανά: Aneta Dudek, κ.ά.
Έκδοση: (2012-01-01)

On the α-Spectral Radius of Uniform Hypergraphs
ανά: Guo Haiyan, κ.ά.
Έκδοση: (2020-05-01)

A Note on Packing of Uniform Hypergraphs
ανά: Konarski Jerzy, κ.ά.
Έκδοση: (2022-11-01)

Almost Self-Complementary Uniform Hypergraphs
ανά: Wojda Adam Paweł
Έκδοση: (2018-05-01)

On vertex independence number of uniform hypergraphs
ανά: Chishti Tariq A., κ.ά.
Έκδοση: (2014-06-01)

Decomposing complete 3-uniform hypergraph K_{n}^{(3)} into 7-cycles
ανά: Meihua, κ.ά.
Έκδοση: (2019-01-01)

Fast sampling via spectral independence beyond bounded-degree graphs
ανά: Bezáková, I, κ.ά.
Έκδοση: (2024)