Author:
Allender Eric,Datta Samir,Roy Sambuddha
Publisher
Springer Berlin Heidelberg
Reference20 articles.
1. Allender, E., Mahajan, M.: The complexity of planarity testing. Information and Computation 189, 117–134 (2004)
2. Allender, E., Reinhardt, K., Zhou, S.: Isolation, matching, and counting: Uniform and nonuniform upper bounds. Journal of Computer and System Sciences 59(2), 164–181 (1999)
3. Barrington, D.A.M.: Grid graph reachability problems. Talk presented at Dagstuhl Seminar on Complexity of Boolean Functions, Seminar number 02121 (2002)
4. Buss, S.R., Hay, L.: On truth-table reducibility to SAT. Inf. Comput. 91(1), 86–102 (1991)
5. Blum, M., Kozen, D.: On the power of the compass (or, why mazes are easier to search than graphs). In: IEEE Symposium on Foundations of Computer Science (FOCS), pp. 132–142 (1978)
Cited by
16 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献