Login / Signup

Hardness of linearly ordered 4-colouring of 3-colourable 3-uniform hypergraphs.

Marek FilakovskýTamio-Vesa NakajimaJakub OprsalGianluca TasinatoUli Wagner
Published in: CoRR (2023)
Keyphrases
  • linearly ordered
  • np hard
  • np complete
  • phase transition
  • truth values
  • worst case
  • information theoretic
  • graph theory
  • computational complexity
  • constraint satisfaction
  • learning theory