Login / Signup

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

Seinosuke TodaMitsunori Ogiwara
Published in: Computational Complexity Conference (1991)
Keyphrases
  • class hierarchy
  • special case
  • computational complexity
  • finite automata
  • positive data
  • database
  • optimal solution
  • support vector machine
  • worst case
  • approximation algorithms