Pages that link to "Item:Q4652619"
From MaRDI portal
The following pages link to On the Hardness of 4-Coloring a 3-Colorable Graph (Q4652619):
Displayed 18 items.
- Dominating set based exact algorithms for \(3\)-coloring (Q1944084) (← links)
- A computational study of exact subgraph based SDP bounds for max-cut, stable set and coloring (Q2196300) (← links)
- Constructive generation of very hard 3-colorability instances (Q2467358) (← links)
- Hypercontractive inequalities via SOS, and the Frankl--Rödl graph (Q2826231) (← 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)
- Hypergraph list coloring and Euclidean Ramsey theory (Q3094608) (← links)
- The Quest for Strong Inapproximability Results with Perfect Completeness (Q5002604) (← links)
- (Q5002681) (← links)
- (Q5092401) (← links)
- Promise Constraint Satisfaction: Algebraic Structure and a Symmetric Boolean Dichotomy (Q5096441) (← 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)
- Robust Factorizations and Colorings of Tensor Graphs (Q6195952) (← links)