View source for Publication:2968154

You do not have permission to edit this page, for the following reasons:

• The action you have requested is limited to users in the group: Users.
• You do not have permission to edit pages in the Publication namespace.

You can view and copy the source of this page.

Return to Hardness of Coloring 2-Colorable 12-Uniform Hypergraphs with $2^{(\log {n})^{\Omega(1)}}$ Colors.