"PP is as Hard as the Polynomial-Time Hierarchy."

Seinosuke Toda (1991)

> Home

Details and statistics

DOI: 10.1137/0220053

access: closed

type: Journal Article

metadata version: 2018-11-14

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/siamcomp/Toda91
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/siamcomp/Toda91
Seinosuke Toda:
PP is as Hard as the Polynomial-Time Hierarchy. SIAM J. Comput. 20(5): 865-877 (1991)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.