The polynomial hierarchy and fragments of bounded arithmetic

  • Authors:
  • S R Buss

  • Affiliations:
  • Department of Mathematics, Princeton University

  • Venue:
  • STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
  • Year:
  • 1985

Quantified Score

Hi-index 0.00

Visualization

Abstract