Project Details
Description
The goals of this project include: (1) Continued investigation of complexity classes related to the computation of the determinant and the rank of integer matrices. Such classes include probabilistic logspace and the class #L of nondeterministic logspace counting problems(for circuits); (2) Continued exploration of resource-bounded measure, particularly as it can be applied to small complexity classes such as P.
Status | Finished |
---|---|
Effective start/end date | 8/1/95 → 7/31/98 |
Funding
- National Science Foundation: $210,000.00
Fingerprint
Explore the research topics touched on by this project. These labels are generated based on the underlying awards/grants. Together they form a unique fingerprint.