Pages that link to "Item:Q1853546"
From MaRDI portal
The following pages link to The inapproximability of non-NP-hard optimization problems. (Q1853546):
Displayed 6 items.
- Parameterized and approximation complexity of \textsc{Partial VC Dimension} (Q1731844) (← links)
- Fixed-parameter approximation: conceptual framework and approximability results (Q2379929) (← links)
- On the computational hardness based on linear fpt-reductions (Q2498987) (← links)
- Parameterized computation and complexity: a new approach dealing with NP-hardness (Q2576825) (← links)
- A Dichotomy Result for Ramsey Quantifiers (Q2947460) (← links)
- Characterizing polynomial Ramsey quantifiers (Q5377702) (← links)