Abstract
Classes of machines using very limited amounts of nondeterminism are studied. The P =? NP question in related to questions about classes lying within P. Complete sets for these classes are given.
| Original language | English |
|---|---|
| Pages (from-to) | 560-572 |
| Number of pages | 13 |
| Journal | SIAM Journal on Computing |
| Volume | 22 |
| Issue number | 3 |
| DOIs | |
| State | Published - 1993 |
ASJC Scopus subject areas
- General Computer Science
- General Mathematics