Decision-tree complexity
mag(2012)
摘要
Two separate results related to decision-tree complexity are presented. The first uses a topological approach to generalize some theorems about the evasiveness of monotone boolean functions to other classes of functions. The second bounds the gap between the deterministic decision-tree complexity of functions on the permutation group Sn and their zero-error randomized decision-tree complexity.
更多查看译文
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络