default search action
"Counting Classes are at Least as Hard as the Polynomial-Time Hierarchy."
Seinosuke Toda, Mitsunori Ogiwara (1992)
- Seinosuke Toda, Mitsunori Ogiwara:
Counting Classes are at Least as Hard as the Polynomial-Time Hierarchy. SIAM J. Comput. 21(2): 316-328 (1992)
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.