Comparing the sizes of nondeterministic branching read-k-times programs

@article{Okolnishnikova2004ComparingTS,
  title={Comparing the sizes of nondeterministic branching read-k-times programs},
  author={Elizaveta A. Okol'nishnikova},
  journal={Discrete Applied Mathematics},
  year={2004},
  volume={135},
  pages={205-222}
}
We compare the complexities of Boolean functions for nondeterministic syntactic read-k-times branching and branching read-sk -times programs. It is shown that for each natural number k, k¿ 2, there exists a sequence of Boolean functions such that the complexity of computation of each function of this sequence by nondeterministic syntactic branching read-k… CONTINUE READING