• search
    search
  • reviewers
    reviewers
  • feeds
    feeds
  • assignments
    assignments
  • settings
  • logout

Inapproximability of Counting Hypergraph Colourings.

Andreas GalanisHeng GuoJiaheng Wang
Published in: ACM Trans. Comput. Theory (2022)
Keyphrases
  • higher order
  • approximation algorithms
  • pairwise
  • np hard
  • hypergraph model
  • image processing
  • training data
  • optimal solution
  • cooperative
  • support vector
  • upper bound
  • high order
  • hyper graph
  • hypergraph partitioning