scientific article
From MaRDI portal
Publication:3751569
zbMath0611.03021MaRDI QIDQ3751569
Publication date: 1986
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Turing machinebranching programsgraph accessibility problemnonuniform complexity classeslogarithmic space complexityp-projection reducibility
Analysis of algorithms and problem complexity (68Q25) Complexity of computation (including implicit computational complexity) (03D15)
Related Items (6)
The power of nondeterminism in polynomial-size bounded-width branching programs ⋮ Branching programs provide lower bounds on the area of multilective deterministic and nondeterministic VLSI circuits ⋮ Separating complexity classes related to certain input oblivious logarithmic space-bounded Turing machines ⋮ Lower bounds for the modular communication complexity of various graph accessibility problems ⋮ Logic vs. complexity theoretic properties of the graph accessibility problem for directed graphs of bounded degree ⋮ A survey of space complexity
This page was built for publication:
