Results 1 -
1 of
1
Bounded-width polynomial-size branching programs recognize exactly those languages
- in NC’, in “Proceedings, 18th ACM STOC
, 1986
"... We show that any language recognized by an NC ’ circuit (fan-in 2, depth O(log n)) can be recognized by a width-5 polynomial-size branching program. As any bounded-width polynomial-size branching program can be simulated by an NC ’ circuit, we have that the class of languages recognized by such prog ..."
Abstract
-
Cited by 184 (13 self)
- Add to MetaCart
We show that any language recognized by an NC ’ circuit (fan-in 2, depth O(log n)) can be recognized by a width-5 polynomial-size branching program. As any bounded-width polynomial-size branching program can be simulated by an NC ’ circuit, we have that the class of languages recognized by such programs is exactly nonuniform NC’. Further, following
