Pages that link to "Item:Q4571885"
From MaRDI portal
The following pages link to Lectures on Proof Verification and Approximation Algorithms (Q4571885):
Displayed 13 items.
- Introduction to the theory of complexity and approximation algorithms (Q4571886) (← links)
- Introduction to randomized algorithms (Q4571887) (← links)
- Derandomization (Q4571888) (← links)
- Proof checking and non-approximability (Q4571889) (← links)
- Proving the PCP-Theorem (Q4571890) (← links)
- Parallel repetition of MIP(2,1) systems (Q4571891) (← links)
- Bounds for approximating MaxLinEq3-2 and MaxEkSat (Q4571892) (← links)
- Deriving non-approximability results by reductions (Q4571893) (← links)
- Optimal non-approximability of MaxClique (Q4571894) (← links)
- The hardness of approximating set cover (Q4571895) (← links)
- Semidefinite programming and its applications to approximation algorithms (Q4571896) (← links)
- Dense instances of hard optimization problems (Q4571897) (← links)
- Polynomial time approximation schemes for geometric optimization problems in euclidean metric spaces (Q4571898) (← links)