Counting classes are at least as hard as the polynomial-time hierarchy

  • Authors:
  • Seinosuke Toda;Mitsunori Ogiwara

  • Affiliations:
  • -;-

  • Venue:
  • SIAM Journal on Computing
  • Year:
  • 1992

Quantified Score

Hi-index 0.00

Visualization

Abstract