Pages that link to "Item:Q3588404"
From MaRDI portal
The following pages link to On the Conditional Hardness of Coloring a 4-Colorable Graph with Super-Constant Number of Colors (Q3588404):
Displaying 7 items.
- On percolation and ‐hardness (Q4633317) (← links)
- Kneser graphs are like Swiss cheese (Q4645027) (← links)
- (Q5009505) (← links)
- (Q5212563) (← links)
- (Q5743408) (← links)
- Topology and Adjunction in Promise Constraint Satisfaction (Q5885596) (← links)
- Improved NP-Hardness of Approximation for Orthogonality Dimension and Minrank (Q6071819) (← links)
