NP-Hardness of Coloring 2-Colorable Hypergraph with Poly-Logarithmically Many Colors

Authors
Publication date
1 January 2018
Publisher
LIPIcs - Leibniz International Proceedings in Informatics. 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018)
Doi

    Abstract

    Abstract is not available.

      Similar works

      Full text

      thumbnail-image

      Available Versions

      Dagstuhl Research Online Publication Server

      redirect
      oaioai:drops-oai.dagstuhl.de:9019
      Last time updated on 09/07/2018