Login / Signup

Hardness of Linearly Ordered 4-Colouring of 3-Colourable 3-Uniform Hypergraphs.

Marek FilakovskýTamio-Vesa NakajimaJakub OprsalGianluca TasinatoUli Wagner
Published in: STACS (2024)
Keyphrases
  • linearly ordered
  • computational complexity
  • np hard
  • truth values
  • knowledge base
  • np complete
  • worst case
  • information theoretic
  • pairwise
  • phase transition
  • learning theory