Pages that link to "Item:Q5932643"
From MaRDI portal
The following pages link to On the hardness of approximating the chromatic number (Q5932643):
Displayed 27 items.
- Deciding \(k\)-colorability of \(P_5\)-free graphs in polynomial time (Q848637) (← links)
- Exact complexity of exact-four-colorability (Q1014384) (← links)
- Graph coloring by multiagent fusion search (Q1037448) (← links)
- Priority algorithms for graph optimization problems (Q1041242) (← links)
- Recognizing DNA graphs is difficult. (Q1868714) (← links)
- Towards optimal lower bounds for clique and chromatic number. (Q1874411) (← links)
- Notes on tree- and path-chromatic number (Q2058953) (← links)
- Remarks on proper conflict-free colorings of graphs (Q2099465) (← links)
- Hypercontractive inequalities via SOS, and the Frankl--Rödl graph (Q2826231) (← links)
- Matrix Relaxations in Combinatorial Optimization (Q2897308) (← 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)
- Balanced coloring of bipartite graphs (Q3057057) (← links)
- Hypergraph list coloring and Euclidean Ramsey theory (Q3094608) (← links)
- The Quest for Strong Inapproximability Results with Perfect Completeness (Q5002604) (← links)
- (Q5092401) (← links)
- Promise Constraint Satisfaction: Algebraic Structure and a Symmetric Boolean Dichotomy (Q5096441) (← links)
- (Q5136286) (← links)
- Hardness of Rainbow Coloring Hypergraphs (Q5136325) (← links)
- Linear Index Coding via Semidefinite Programming (Q5410256) (← links)
- (Q5743408) (← links)
- (Q5870293) (← links)
- CLAP: A New Algorithm for Promise CSPs (Q5885595) (← links)
- Topology and Adjunction in Promise Constraint Satisfaction (Q5885596) (← links)
- Tensors in computations (Q5887832) (← links)
- Improved NP-Hardness of Approximation for Orthogonality Dimension and Minrank (Q6071819) (← links)
- 5-list coloring toroidal 6-regular triangulations in linear time (Q6132529) (← links)