Pages that link to "Item:Q5146862"
From MaRDI portal
The following pages link to Improved hardness for <i>H</i>-colourings of <i>G</i>-colourable graphs (Q5146862):
Displaying 16 items.
- Strengthening the Lovász \(\theta(\overline G)\) bound for graph coloring (Q1774164) (← links)
- Beyond PCSP (\textbf{1-in-3}, \textbf{NAE}) (Q2105441) (← links)
- (Q5060749) (← links)
- (Q5092472) (← links)
- Promise Constraint Satisfaction: Algebraic Structure and a Symmetric Boolean Dichotomy (Q5096441) (← links)
- The Power of the Combined Basic Linear Programming and Affine Relaxation for Promise Constraint Satisfaction Problems (Q5138784) (← links)
- Rainbow Coloring Hardness via Low Sensitivity Polymorphisms (Q5217824) (← links)
- (Q5870293) (← links)
- Rainbow Coloring Hardness via Low Sensitivity Polymorphisms (Q5875467) (← links)
- CLAP: A New Algorithm for Promise CSPs (Q5885595) (← links)
- Topology and Adjunction in Promise Constraint Satisfaction (Q5885596) (← 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)
- Functors on relational structures which admit both left and right adjoints (Q6573001) (← links)
- Geometric, algebraic and topological combinatorics. Abstracts from the workshop held December 10--15, 2023 (Q6613402) (← links)