Entity usage
From MaRDI portal
This page lists pages that use the given entity (e.g. Q42). The list is sorted by descending page ID, so that newer pages are listed first.
Showing below up to 13 results in range #1 to #13.
- Polynomial time approximation schemes for geometric optimization problems in euclidean metric spaces: Label: en
- Dense instances of hard optimization problems: Label: en
- Semidefinite programming and its applications to approximation algorithms: Label: en
- The hardness of approximating set cover: Label: en
- Optimal non-approximability of MaxClique: Label: en
- Deriving non-approximability results by reductions: Label: en
- Bounds for approximating MaxLinEq3-2 and MaxEkSat: Label: en
- Parallel repetition of MIP(2,1) systems: Label: en
- Proving the PCP-Theorem: Label: en
- Proof checking and non-approximability: Label: en
- Derandomization: Label: en
- Introduction to randomized algorithms: Label: en
- Introduction to the theory of complexity and approximation algorithms: Label: en