Refining Nondeterminism in Relativized Polynomial-Time Bounded Computations (Q3893305): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 19:49, 5 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Refining Nondeterminism in Relativized Polynomial-Time Bounded Computations |
scientific article |
Statements
Refining Nondeterminism in Relativized Polynomial-Time Bounded Computations (English)
0 references
1980
0 references
nondeterminism
0 references
relativized polynomial-time bounded computations
0 references
class of languages acceptable by polynomial-time bounded Turing machines
0 references
relativized classes
0 references
oracle sets
0 references
