scientific article
From MaRDI portal
Publication:3191580
DOI10.4086/toc.2013.v009a011zbMath1448.68246OpenAlexW2610340222MaRDI QIDQ3191580
Ali Kemal Sinop, Venkatesan Guruswami
Publication date: 6 October 2014
Published in: Theory of Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.4086/toc.2013.v009a011
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Coloring of graphs and hypergraphs (05C15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (5)
Pseudorandom sets in Grassmann graph have near-perfect expansion ⋮ Unnamed Item ⋮ The Maximum Binary Tree Problem. ⋮ The maximum binary tree problem ⋮ The Quest for Strong Inapproximability Results with Perfect Completeness
Cites Work
This page was built for publication:
