On the complexity of branching programs and decision trees for clique functions

@article{Wegener1988OnTC,
  title={On the complexity of branching programs and decision trees for clique functions},
  author={Ingo Wegener},
  journal={J. ACM},
  year={1988},
  volume={35},
  pages={461-471}
}
Exponential lower bounds on the complexity of computing the clique functions in the Boolean decision-tree model are proved. For one-time-only branching programs, large polynomial lower bounds are proved for <italic>k</italic>-clique functions if <italic>k</italic> is fixed, and exponential lower bounds if <italic>k</italic> increases with <italic>n</italic>. Finally, the hierarchy of the classes BP<subscrpt><italic>d</italic></subscrpt>(<italic>P</italic>) of all sequences of Boolean functions… CONTINUE READING