Publication:3787493
From MaRDI portal
zbMath0644.68074MaRDI QIDQ3787493
Publication date: 1988
68Q25: Analysis of algorithms and problem complexity
68N01: General topics in the theory of software
Related Items
Logic vs. complexity theoretic properties of the graph accessibility problem for directed graphs of bounded degree, 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