Pages that link to "Item:Q2765960"
From MaRDI portal
The following pages link to Approximating Coloring and Maximum Independent Sets in 3-Uniform Hypergraphs (Q2765960):
Displaying 13 items.
- On vertex independence number of uniform hypergraphs (Q399512) (← links)
- Independent sets in semi-random hypergraphs (Q832900) (← links)
- Independent sets in bounded-degree hypergraphs (Q1026137) (← links)
- An expected polynomial time algorithm for coloring 2-colorable 3-graphs (Q2851504) (← links)
- Super-Polylogarithmic Hypergraph Coloring Hardness via Low-Degree Long Codes (Q2968149) (← links)
- Hardness of Coloring 2-Colorable 12-Uniform Hypergraphs with $2^{(\log {n})^{\Omega(1)}}$ Colors (Q2968154) (← links)
- Improved Approximation Guarantees through Higher Levels of SDP Hierarchies (Q3541786) (← links)
- Lower Bounds on the Size of Maximum Independent Sets and Matchings in Hypergraphs of Rank Three (Q4908832) (← links)
- (Q5092401) (← links)
- Hardness of Rainbow Coloring Hypergraphs (Q5136325) (← links)
- A Characterization of hard-to-cover CSPs (Q5857608) (← links)
- (Q5870293) (← links)
- Coloring tournaments with few colors: algorithms and complexity (Q6654122) (← links)
