Talk:PH (complexity)

This article is rated Stub-class on Wikipedia's content assessment scale.
It is of interest to the following WikiProjects:

Mathematics Low‑priority

	Mathematics portal This article is within the scope of WikiProject Mathematics, a collaborative effort to improve the coverage of mathematics on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.MathematicsWikipedia:WikiProject MathematicsTemplate:WikiProject Mathematicsmathematics articles
Low	This article has been rated as Low-priority on the project's priority scale.

Computer science

This article is within the scope of WikiProject Computer science, a collaborative effort to improve the coverage of Computer science related articles on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.Computer scienceWikipedia:WikiProject Computer scienceTemplate:WikiProject Computer scienceComputer science articles

??? This article has not yet received a rating on the project's importance scale.

This article has been automatically rated by a bot or other tool because one or more other projects use this class. Please ensure the assessment is correct before removing the |auto= parameter.

Things you can help WikiProject Computer science with:

Here are some tasks awaiting attention:

Article requests :
- Requested articles/Applied arts and sciences/Computer science, computing, and Internet
Cleanup :
- Computer science articles needing attention
- Computer science articles needing expert attention
Copyedit :
- Computing
Expand :
- Computer science
Infobox :
- Computer science articles without infoboxes
Maintain :
- Timeline of computing 2020–present
Photo :
- Find pictures for the biographies of computer scientists (see List of computer scientists)
- Computing articles needing images
Stubs :
- Computer science stubs
Unreferenced :
- WikiProject Computer science/Unreferenced BLPs
Project-related :
- Tag all relevant articles in Category:Computer science and sub-categories with {{WikiProject Computer science}}

Proof of P=NP if and only if P=PH[edit]

Let P=NP. P is closed under complement, therefore NP=co-NP. NP = Σ1, and co-NP = ∏1. Therefore Σ1 = ∏1. If Σi = ∏i for any i the entire hierarchy collapses to Σi.^[1], So PH = Σ1 = NP = P.

Let P=PH. NP=Σ1⊆PH=P, Therefore NP⊆P and trivially P⊆NP. Therefore, P=NP

Note this proof cites Wikipedia and should not be added verbatim to the page Yonatan Vernik (talk) 19:15, 30 November 2018 (UTC)[reply]

References

^ https://en.wikipedia.org/wiki/Polynomial_hierarchy

forrelation[edit]

The article says there is “some evidence” that BQP is not contained in PH. Actually, there’s a proof. Forrelation is in BQP, but not in PH. https://epubs.siam.org/doi/abs/10.1137/15M1050902

[1] ttps://en.wikipedia.org/wiki/Polynomial_hierarchy

[1]