scientific article; zbMATH DE number 6471449

DOI10.4086/cjtcs.2015.003zbMath1337.68119arXiv1408.0262OpenAlexW4248132473MaRDI QIDQ5500597

Girish Varma

Publication date: 7 August 2015

Published in: Chicago Journal of Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1408.0262

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

hardness of approximationhypergraph coloring

Mathematics Subject Classification ID

Hypergraphs (05C65) Coloring of graphs and hypergraphs (05C15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (5)

Unnamed Item ⋮ Super-Polylogarithmic Hypergraph Coloring Hardness via Low-Degree Long Codes ⋮ Hardness of Coloring 2-Colorable 12-Uniform Hypergraphs with $2^{(\log {n})^{\Omega(1)}}$ Colors ⋮ A Characterization of hard-to-cover CSPs ⋮ Hardness of Rainbow Coloring Hypergraphs

This page was built for publication: