PH = PSPACEEasyChair Preprint no. 7481, version historyVersion  Date  Pages  Version notes 

1  February 19, 2022  5  —  2  October 3, 2022  6  More details and consequences were added. Some mistypes have been noticed. Chapter about P versus NP problem and the ATL (Alternatingtime Temporal Logic) satisfiability problem appended.  3  October 3, 2022  6  Overcoming mistypes  4  October 26, 2022  6  Chapter P versus NP about Millennium Prize Problem was added!  5  November 2, 2022  6  Details about exponential complexity classes are provided. 
Keyphrases: BQP, computational complexity, polynomial hierarchy, PSPACE, QBFs, Quantified Boolean Formula 
