Author:
Balaji Nikhil,Datta Samir
Publisher
Springer International Publishing
Reference20 articles.
1. Allender, E., Beals, R., Ogihara, M.: The complexity of matrix rank and feasible systems of linear equations. Comput. Complex. 8(2), 99–126 (1999)
2. Modern Birkhäuser Classics;T Aardenne-Ehrenfest,1987
3. Berkowitz, S.J.: On computing the determinant in small parallel time using a small number of processors. Inf. Process. Lett. 18(3), 147–150 (1984)
4. Brightwell, G., Winkler, P.: Counting eulerian circuits is# p-complete. In: ALENEX/ANALCO, pp. 259–262. Citeseer (2005)
5. Chebolu, P., Cryan, M., Martin, R.: Exact counting of euler tours for generalized series-parallel graphs. J. Discrete Algorithms 10, 110–122 (2012)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献