Author:
Gilmer Justin,Saks Michael,Srinivasan Srikanth
Publisher
Springer Science and Business Media LLC
Subject
Computational Mathematics,Discrete Mathematics and Combinatorics
Reference10 articles.
1. S. Aaronson: Quantum certificate complexity, J. Comput. Syst. Sci. 74 (2008), 313–322.
2. H. Buhrman and R. de Wolf: Complexity measures and decision tree complexity: a survey, Theor. Comput. Sci. 288 (2002), 21–43.
3. S. Bublitz, U. Schurfeld and I. Wegener: Properties of complexity measures for PRAMs and WRAMs, Theor. Comput. Sci. 48 (1986), 53–73.
4. P. Hatami, R. Kulkarni and D. Pankratov: Variations on the Sensitivity Con-jecture, Number 4 in Graduate Surveys, Theory of Computing Library, 2011.
5. C. D. Meyer: Matrix analysis and applied linear algebra, Society for Industrial and Applied Mathematics, Philadelphia, PA, USA, 2000.
Cited by
10 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献