arXiv Open Access 2022

A note on hardness of promise hypergraph colouring

Marcin Wrochna

Lihat Sumber

Abstrak

We show a slightly simpler proof the following theorem by I. Dinur, O. Regev, and C. Smyth: for all $c \geq 2$, it is NP-hard to find a $c$-colouring of a 2-coloruable 3-uniform hypergraph. We recast this result in the algebraic framework for Promise CSPs, using only a weaker version of the PCP theorem.

Topik & Kata Kunci

cs.DM

Penulis (1)

Marcin Wrochna

Format Sitasi

APA MLA BibTeX

Wrochna, M. (2022). A note on hardness of promise hypergraph colouring. https://arxiv.org/abs/2205.14719

Akses Cepat

Lihat di Sumber

Informasi Jurnal

Tahun Terbit: 2022
Bahasa: en
Sumber Database: arXiv
Akses: Open Access ✓