scientific article
From MaRDI portal
Publication:3129926
zbMath0870.68112MaRDI QIDQ3129926
Noga Alon, H. Ramesh, Pierre Kelsen, Sanjeev Mahajan
Publication date: 7 September 1997
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Hypergraphs (05C65) Graph theory (including graph drawing) in computer science (68R10) Coloring of graphs and hypergraphs (05C15)
Related Items (6)
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 ⋮ Testing hypergraph colorability ⋮ Unnamed Item ⋮ Quasi-polynomial algorithms for list-coloring of nearly intersecting hypergraphs
This page was built for publication:
