"Inapproximability of Counting Hypergraph Colourings."

Andreas Galanis, Heng Guo, Jiaheng Wang (2022)

> Home

Details and statistics

DOI: 10.1145/3558554

access: closed

type: Journal Article

metadata version: 2023-08-18

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/toct/GalanisGW22
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/toct/GalanisGW22
Andreas Galanis, Heng Guo, Jiaheng Wang:
Inapproximability of Counting Hypergraph Colourings. ACM Trans. Comput. Theory 14(3-4): 1-33 (2022)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.