Pages that link to "Item:Q5368748"
From MaRDI portal
The following pages link to New hardness results for graph and hypergraph colorings (Q5368748):
Displaying 18 items.
- Super-Polylogarithmic Hypergraph Coloring Hardness via Low-Degree Long Codes (Q2968149) (← links)
- (Q4993594) (← links)
- The Quest for Strong Inapproximability Results with Perfect Completeness (Q5002604) (← links)
- Vertex isoperimetry and independent set stability for tensor powers of cliques (Q5002636) (← links)
- (Q5002681) (← links)
- (Q5091214) (← links)
- (Q5092401) (← links)
- Promise Constraint Satisfaction: Algebraic Structure and a Symmetric Boolean Dichotomy (Q5096441) (← links)
- Rainbow Coloring Hardness via Low Sensitivity Polymorphisms (Q5217824) (← links)
- $(2+\varepsilon)$-Sat Is NP-hard (Q5363382) (← links)
- Constraint Satisfaction Problems with Global Modular Constraints: Algorithms and Hardness via Polynomial Representations (Q5864666) (← links)
- (Q5870293) (← links)
- Rainbow Coloring Hardness via Low Sensitivity Polymorphisms (Q5875467) (← links)
- Topology and Adjunction in Promise Constraint Satisfaction (Q5885596) (← links)
- Approximately coloring graphs without long induced paths (Q5915792) (← links)
- Improved NP-Hardness of Approximation for Orthogonality Dimension and Minrank (Q6071819) (← links)
- Robust Factorizations and Colorings of Tensor Graphs (Q6195952) (← links)
- Conditional dichotomy of Boolean ordered promise CSPs (Q6566587) (← links)
