Counting in Structural Complexity Theory
| dc.contributor.author | Hemachandra, Lane A. | en_US |
| dc.date.accessioned | 2007-04-23T17:20:11Z | |
| dc.date.available | 2007-04-23T17:20:11Z | |
| dc.date.issued | 1987-06 | en_US |
| dc.description.abstract | Structural complexity theory is the study of the form and meaning of computational complexity classes. Complexity classes - P, NP, Probabilistic P, 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 strengths of their underlying computational paradigms. This thesis studies counting in structural complexity theory. We are interested in complexity classes defined by counting and in the use of counting to explore the structure of these and other classes. | en_US |
| dc.format.extent | 8256150 bytes | |
| dc.format.extent | 1921231 bytes | |
| dc.format.mimetype | application/pdf | |
| dc.format.mimetype | application/postscript | |
| dc.identifier.citation | http://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR87-840 | en_US |
| dc.identifier.uri | https://hdl.handle.net/1813/6680 | |
| dc.language.iso | en_US | en_US |
| dc.publisher | Cornell University | en_US |
| dc.subject | computer science | en_US |
| dc.subject | technical report | en_US |
| dc.title | Counting in Structural Complexity Theory | en_US |
| dc.type | technical report | en_US |