Author:
Kulkarni Raghav,Santha Miklos
Publisher
Springer Berlin Heidelberg
Reference27 articles.
1. Barnum, H., Saks, M.E.: A lower bound on the quantum query complexity of read-once functions. J. Comput. Syst. Sci. 69(2), 244–258 (2004)
2. Beigel, R.: The Polynomial Method in Circuit Complexity. In: Structure in Complexity Theory Conference, pp. 82–95 (1993)
3. Bernasconi, A., Codenotti, B.: Spectral Analysis of Boolean Functions as a Graph Eigenvalue Problem. IEEE Trans. Computers 48(3), 345–351 (1999)
4. Björner, A.: Matroid Applications (ch. 7.). In: Homology and Shellability of Matroids and Geometric Lattices, pp. 226–283 (1992)
5. Björner, A., Lovász, L., Yao, A.C.-C.: Linear Decision Trees: Volume Estimates and Topological Bounds. In: STOC 1992, pp. 170–177 (1992)
Cited by
7 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献