<p>Is there an oracle <span class="math-container">$A$</span> for which <span class="math-container">$P^A =PH^A \neq CH^A = NEXP^A$</span> holds?</p>

CC BY-SA 4.0
2020-10-07T21:21:18.007Z
Hmm, I am not sure why there are down votes and close votes... what's wrong with this question? Too short, not well-researched?
Ryan Williams
CC BY-SA 4.0
2020-10-20T00:16:54.107Z
We have $P^A=PH^A\neq CH^A$ from https://cstheory.stackexchange.com/questions/44503/evidence-for-mathsfp-neq-mathsfpp-if-the-polynomial-hierarchy-collapses. However it does not give $CH^A=NEXP^A$.
Turbo
<counting-complexity><oracles>
Is there an oracle that separates $PH$ from counting classes?
Turbo
# Is there an oracle that separates $PH$ from counting classes?

(Asked by: username_0 on 2020-10-02)

Is there an oracle $A$ for which $P^A =PH^A \neq CH^A = NEXP^A$ holds?

**Tags:** counting-complexity, oracles
> **Comments:**
> **username_1**: Hmm, I am not sure why there are down votes and close votes... what's wrong with this question? Too short, not well-researched?  
> **username_0**: We have $P^A=PH^A\neq CH^A$ from https://cstheory.stackexchange.com/questions/44503/evidence-for-mathsfp-neq-mathsfpp-if-the-polynomial-hierarchy-collapses. However it does not give $CH^A=NEXP^A$.  

---

## 0 answers

