The Polynomial Hierarchy - Corelab
The Polynomial Hierarchy - Corelab
The Polynomial Hierarchy - Corelab
You also want an ePaper? Increase the reach of your titles
YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.
DP Class Definition<strong>The</strong><strong>Polynomial</strong><strong>Hierarchy</strong>A.AntonopoulosOutlineOptimizationProblemsIntroduction<strong>The</strong> Class DPOracle Classes<strong>The</strong><strong>Polynomial</strong><strong>Hierarchy</strong>DefinitionBasic <strong>The</strong>oremsBPP and PHDefinitionA language L is in the class DP if and only if there are twolanguages L 1 ∈ NP and L 2 ∈ coNP such that L = L 1 ∩ L 2 .DP is not NP ∩ coNP!Also, DP is a syntactic class, and so it has completeproblems.
Change language