Counting in structural complexity theory

@inproceedings{Hemachandra1987CountingIS,
  title={Counting in structural complexity theory},
  author={L. Hemachandra},
  year={1987}
}
Structural complexity theory is the study of the form and meaning of computational complexity classes. Complexity classes--P, NP, ProbabilisticP, PSPACE, etc.--are formalizations of computational powers--deterministic, nondeterministic, probabilistic, etc. By examining the structure of and the relationships between these classes, we seek to understand the relative strength of their underlying computational paradigms. This thesis studies counting in structural complexity theory. We are… CONTINUE READING