Author:
Chauhan Ankit,Rao B. V. Raghavendra
Publisher
Springer International Publishing
Reference24 articles.
1. Allender, E., Bürgisser, P., Kjeldgaard-Pedersen, J., Miltersen, P.B.: On the complexity of numerical analysis. SIAM J. Comput. 38(5), 1987–2006 (2009)
2. Allender, E., Wagner, K.W.: Counting hierarchies: Polynomial time and constant. Bulletin of the EATCS 40, 182–194 (1990)
3. Alon, N.: Combinatorial nullstellensatz. Combinatorics, Problem and Computing 8 (1999)
4. Arora, S., Barak, B.: Computational Complexity: A Modern approach. Cambridge Univeristy Press (2009)
5. Bläser, M., Curticapean, R.: Weighted counting of k-matchings is #W[1]-hard. In: IPEC, pp. 171–181 (2012)
Cited by
8 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献