Pages that link to "Item:Q1874411"
From MaRDI portal
The following pages link to Towards optimal lower bounds for clique and chromatic number. (Q1874411):
Displaying 11 items.
- Longest common subsequence problem for unoriented and cyclic strings (Q868937) (← links)
- The 0-1 inverse maximum stable set problem (Q955316) (← links)
- Zero knowledge and the chromatic number (Q1276168) (← links)
- Inapproximability results for equations over finite groups (Q1884871) (← links)
- A review on algorithms for maximum clique problems (Q2630214) (← links)
- Efficient computation of sparse structures (Q2820273) (← links)
- Reducing the Clique and Chromatic Number via Edge Contractions and Vertex Deletions (Q2835660) (← links)
- Linear degree extractors and the inapproximability of max clique and chromatic number (Q2931428) (← links)
- Linear degree extractors and the inapproximability of max clique and chromatic number (Q3002782) (← links)
- More efficient queries in PCPs for NP and improved approximation hardness of maximum CSP (Q3608306) (← links)
- On the advantage over a random assignment (Q5894908) (← links)