Advertisement

Ω=branching programs and theirs computational power

Chapter
  • 130 Downloads
Part of the Lecture Notes in Computer Science book series (LNCS, volume 370)

Keywords

Boolean 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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 1989

Personalised recommendations