Author:
Mahajan Meena,Subramanya P.R.,Vinay V.
Subject
Applied Mathematics,Discrete Mathematics and Combinatorics
Reference24 articles.
1. E. Allender, M. Mahajan, The complexity of planarity testing, in: H. Reichel, S. Tison (Eds.), Proceedings of the Symposium on Theoretical Aspects of Computing (STACS), Lecture Notes in Computer Science, Vol. 1770, Springer, Berlin, 2000; Inform. Comput., to appear.
2. Isolation, matching and counting;Allender;J. Comput. System Sci,1999
3. F. Barahona, Balancing signed toroidal graphs in polynomial time, Preprint, University of Chile, 1983.
4. Random pseudo-polynomial algorithms for exact matroid problems;Camerini;J. Algorithms,1992
5. C. Damm, DET=L(#L), Technical Report Informatik, Preprint 8, Fachbereich Informatik der Humboldt, Universität zu Berlin, 1991.
Cited by
12 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献