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

Seinosuke Toda Mitsunori Ogiwara

Published in: SIAM J. Comput. (1992)

Keyphrases

class hierarchy
special case
positive data
worst case
computational complexity
higher level
real time
data sets
data mining
website
case study
class labels
hierarchical structure
approximation algorithms
grammatical inference
finite automata