Title
NP-Hardness of Coloring 2-Colorable Hypergraph with Poly-Logarithmically Many Colors.
Year
Venue
Field
2018
ICALP
Discrete mathematics,Combinatorics,Hypergraph,Mathematics
DocType
Citations 
PageRank 
Conference
0
0.34
References 
Authors
0
1
Name
Order
Citations
PageRank
Amey Bhangale1106.71