×
Selman, Alan L.

Analogues of semirecursive sets and effective reducibilities to the study of NP complexity. (English) Zbl 0504.03022

Inf. Control 52, 36-51 (1982).
Page: −5 −4 −3 −2 −1 ±0 +1 +2 +3 +4 +5 Show Scanned Page
scan of Zbl 0504.03022

Cited in 1 Review
Cited in 20 Documents

MSC:

03D15 Complexity of computation (including implicit computational complexity)

Keywords:

semirecursive sets; NP complexity; deterministic exponential time
Cite Review PDF
Full Text: DOI