# Counting in structural complexity theory

@inproceedings{Hemachandra1987CountingIS, title={Counting in structural complexity theory}, author={L. Hemachandra}, year={1987} }

- Published 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

#### Topics from this paper.

#### Citations

##### Publications citing this paper.

SHOWING 1-9 OF 9 CITATIONS

## Superpolynomial Circuits, Almost Sparse Oracles and the Exponential Hierarchy

VIEW 5 EXCERPTS

CITES BACKGROUND

HIGHLY INFLUENCED

#### Similar Papers

Loading similar papers…