Subject
Computer Science Applications,Information Systems,Signal Processing,Theoretical Computer Science
Reference10 articles.
1. Tight bounds on the average sensitivity of k-CNF;Amano;Theory Comput.,2011
2. New separation between s(f) and bs(f);Ambainis;Electron. Colloq. Comput. Complexity,2011
3. Complexity measures and decision tree complexity: A survey;Buhrman;Theoret. Comput. Sci.,2002
4. Sourav Chakraborty, On the sensitivity of cyclically-invariant Boolean functions, in: Proc. of IEEE Conf. on Computational Complexity, 2005, pp. 163–167.
5. Upper and lower time bounds for parallel random access machines without simultaneous writes;Cook;SIAM J. Comput.,1986
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献