Wegener, Ingo On the complexity of branching programs and decision trees for clique functions. (English) Zbl 0652.68063 J. Assoc. Comput. Mach. 35, No. 2, 461-471 (1988). Cited in 1 ReviewCited in 30 Documents MSC: 68Q05 Models of computation (Turing machines, etc.) (MSC2010) 68Q25 Analysis of algorithms and problem complexity 68R10 Graph theory (including graph drawing) in computer science Keywords:complexity hierarchies; clique functions; Boolean decision-tree; branching programs; polynomial lower bounds; sequences of Boolean functions × Cite Format Result Cite Review PDF Full Text: DOI