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)