Ω=branching programs and theirs computational power
Part of the Lecture Notes in Computer Science book series (LNCS, volume 370)
- 130 Downloads
KeywordsBoolean Function Turing Machine Complexity Class Computation Path Successor Node
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Unable to display preview. Download preview PDF.
© Springer-Verlag Berlin Heidelberg 1989