article · 1985
Applications of Ramsey's theorem to decision tree complexity
Combinatorial techniques for extending lower bound results for decision trees to general types of queries are presented. Problems that are defined by simple ...
39 citationsDOI: https://doi.org/10.1145/4221.4259Open accessPDF reported by metadataFull text reported by metadata