STOC 1972
A Hierarchy for Nondeterministic Time Complexity
Abstract
The purpose of this paper is to prove the following result:
Authors
Keywords
No keywords are indexed for this paper.
Context
- Venue
- ACM Symposium on Theory of Computing
- Archive span
- 1969-2025
- Indexed papers
- 4364
- Paper id
- 244967754466514851