@article{Toda:SIAMJoC:1991,
    Author = {Toda, Seinosuke},
    EPrint = {https://doi.org/10.1137/0220053},
    File = {PP is as Hard as the Polynomial-Time Hierarchy Read More- https-epubs.siam.orgdoi10.11370220053 - toda1991.pdf},
    Journal = {SIAM Journal on Computing},
    Number = {5},
    Pages = {865--877},
    Title = {PP is as Hard as the Polynomial-Time Hierarchy},
    URL = {https://doi.org/10.1137/0220053},
    Volume = {20},
    Year = {1991},
    bdsk-url-1 = {https://doi.org/10.1137/0220053},
    date-added = {2021-11-23 14:37:00 +0100},
    date-modified = {2021-11-23 14:37:00 +0100},
    doi = {10.1137/0220053}
}

@article{Toda:SIAMJoC:1991, Author = {Toda, Seinosuke}, EPrint = {https://doi.org/10.1137/0220053}, File = {PP is as Hard as the Polynomial-Time Hierarchy Read More- https-epubs.siam.orgdoi10.11370220053 - toda1991.pdf}, Journal = {SIAM Journal on Computing}, Number = {5}, Pages = {865--877}, Title = {PP is as Hard as the Polynomial-Time Hierarchy}, URL = {https://doi.org/10.1137/0220053}, Volume = {20}, Year = {1991}, bdsk-url-1 = {https://doi.org/10.1137/0220053}, date-added = {2021-11-23 14:37:00 +0100}, date-modified = {2021-11-23 14:37:00 +0100}, doi = {10.1137/0220053} }