Counting in Structural Complexity Theory
Loading...
No Access Until
Permanent Link(s)
Collections
Other Titles
Author(s)
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.
Journal / Series
Volume & Issue
Description
Sponsorship
Date Issued
1987-06
Publisher
Cornell University
Keywords
computer science; technical report
Location
Effective Date
Expiration Date
Sector
Employer
Union
Union Local
NAICS
Number of Workers
Committee Chair
Committee Co-Chair
Committee Member
Degree Discipline
Degree Name
Degree Level
Related Version
Related DOI
Related To
Related Part
Based on Related Item
Has Other Format(s)
Part of Related Item
Related To
Related Publication(s)
Link(s) to Related Publication(s)
References
Link(s) to Reference(s)
Previously Published As
http://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR87-840
Government Document
ISBN
ISMN
ISSN
Other Identifiers
Rights
Rights URI
Types
technical report