Pages that link to "Item:Q2800551"
From MaRDI portal
The following pages link to On hardness of approximating the parameterized clique problem (Q2800551):
Displaying 9 items.
- On the complexity of fixed parameter clique and dominating set (Q703534) (← links)
- On the query complexity of clique size and maximum satisfiability (Q1816736) (← links)
- New tools and connections for exponential-time approximation (Q2272598) (← links)
- On NP-hardness of the clique partition -- independence number gap recognition and related problems (Q2368935) (← links)
- Some lower bounds in parameterized \(\mathrm{AC}^{0}\) (Q2417855) (← links)
- Interactive proofs and the hardness of approximating cliques (Q4371671) (← links)
- From Gap-Exponential Time Hypothesis to Fixed Parameter Tractable Inapproximability: Clique, Dominating Set, and More (Q5115701) (← links)
- Almost Optimal Lower Bounds for Problems Parameterized by Clique-Width (Q5173247) (← links)
- On approximating the number of k-cliques in sublinear time (Q5230333) (← links)