scientific article
From MaRDI portal
Publication:3787493
zbMath0644.68074MaRDI QIDQ3787493
Publication date: 1988
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) General topics in the theory of software (68N01)
Related Items (3)
Separating complexity classes related to certain input oblivious logarithmic space-bounded Turing machines ⋮ Separating $\oplus L$ from $L, NL,$ co-$NL$, and $AL = P$ for oblivious Turing machines of linear access ⋮ Logic vs. complexity theoretic properties of the graph accessibility problem for directed graphs of bounded degree
This page was built for publication:
