scientific article
From MaRDI portal
Publication:3682474
zbMath0567.03016MaRDI QIDQ3682474
Publication date: 1984
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
transitive closurenondeterministic log-space many-one reducibilityrelativization of logarithmic space
Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45) Complexity of computation (including implicit computational complexity) (03D15)
Related Items (3)
Separation with the Ruzzo, Simon, and Tompa relativization implies DSPACE(log n)\(\neq NSPACE(\log \,n)\) ⋮ Decompositions of nondeterministic reductions ⋮ A very hard log-space counting class
This page was built for publication:
