Tag: polynomial-hierarchy

Found 28 results for 'polynomial-hierarchy'.

---

1) cc.complexity-theory - PH and Optimization Problems
2) complexity-classes - Complete problem in $\Sigma_2^p$ - $\Sigma_{2}SAT$
3) cc.complexity-theory - Interesting SUBSET-SUM problems
4) complexity-classes - Examples of $\Sigma_2^p$ complete problems?
5) cc.complexity-theory - Is there a PSPACE-intermediate language?
6) cc.complexity-theory - What are the problems in EXPSPACE \ EXPTIME?
7) cc.complexity-theory - Coding theory and complete problems
8) cc.complexity-theory - Non-uniform version for the whole polynomial hierarchy
9) cc.complexity-theory - Is there a Time Hierarchy theorem for PH?
10) cc.complexity-theory - Complexity of a certain leaf language with Prime & Composite number of accepting paths.
11) cc.complexity-theory - What does $\#P\subseteq FP^{PPAD}$ imply?
12) cc.complexity-theory - On the proof of Meyer's Theorem
13) cc.complexity-theory - canonical complete problems for $\Delta^P_n$
14) cc.complexity-theory - Can one amplify P=NP beyond P=PH?
15) cc.complexity-theory - Is $PH \subseteq PP$?
16) cc.complexity-theory - Is the collapse of $PH$ known to extend downward to classes in-between its levels?
17) cc.complexity-theory - On $\Delta_i^P$
18) complexity-classes - Is $\sf{P^{NP \cap coNP}} = \sf{NP \cap coNP}$?
19) cc.complexity-theory - A decision problem which is not known to be in PH but will be in P if P=NP
20) cc.complexity-theory - Why doesn't P=NP imply P=AP (i.e. P=PSPACE)?
21) cc.complexity-theory - Consequences of a distillation algorithm for PSPACE
22) oracles - It is known that $L \subsetneq PH$?
23) cc.complexity-theory - Oracle relative to which $\mathsf{BPP}$ is not contained in $Δ_2 \mathsf{P}$
24) randomness - When does randomization stops helping within PSPACE
25) cc.complexity-theory - Is $UP\not=NP$ with respect to random oracle?
26) cc.complexity-theory - Oracle relative to which $\mathsf{BPP}$ is not contained in $Δ_2 \mathsf{P}$
27) cc.complexity-theory - Is there a problem currently known to be outside class $\mathsf{NP}\cup\mathsf{coNP}$ but inside $\mathsf{BPP}$?
28) cc.complexity-theory - A decision problem which is not known to be in PH but will be in P if P=NP

---