The following pages link to (Q3779737):
Displaying 10 items.
- Some classes of languages in \(NC^ 1\) (Q756426) (← links)
- On oblivious branching programs of linear length (Q804285) (← links)
- Polynomial size \(\Omega\)-branching programs and their computational power (Q918199) (← links)
- Arithmetizing classes around {\textsf{NC}}\(^{1}\) and {\textsf{L}} (Q968272) (← links)
- The power of nondeterminism in polynomial-size bounded-width branching programs (Q1116338) (← links)
- Bounded-width polynomial-size branching programs recognize exactly those languages in \(NC^ 1\) (Q1117696) (← links)
- Separating the eraser Turing machine classes \(L_ e\), \(NL_ e\), \(co- NL_ e\) and \(P_ e\) (Q1178711) (← links)
- Reachability and the power of local ordering (Q1367543) (← links)
- On arithmetic branching programs (Q1961372) (← links)
- Switching graphs and their complexity (Q3975159) (← links)
