Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

"Counting Classes are at Least as Hard as the Polynomial-Time Hierarchy."

Seinosuke Toda, Mitsunori Ogiwara (1992)

> Home

Details and statistics

DOI: 10.1137/0221023

access: closed

type: Journal Article

metadata version: 2017-05-27

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/siamcomp/TodaO92
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/siamcomp/TodaO92
Seinosuke Toda, Mitsunori Ogiwara:
Counting Classes are at Least as Hard as the Polynomial-Time Hierarchy. SIAM J. Comput. 21(2): 316-328 (1992)

a service of

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.