Author:
Arvind V.,Mukhopadhyay Partha
Publisher
Springer Berlin Heidelberg
Reference20 articles.
1. Lecture Notes in Computer Science;M. Agrawal,2005
2. Agrawal, M.: Rings and Integer Lattices in Computer Science. In: Barbados Workshop on Computational Complexity, Lecture no. 9 (2007)
3. Reinhardt, K., Allender, E.: Making Nondeterminism Unambiguous. SIAM J. Comput. 29(4), 1118–1131 (2000)
4. 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)
5. Arvind, V., Mukhopadhyay, P., Srinivasan, S.: New results on Noncommutative and Commutative Polynomial Identity Testing. In: Proceedings of the 23rd IEEE Conference on Computational Complexity (to appear, June 2008)
Cited by
13 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Solving Connectivity Problems Parameterized by Treewidth in Single Exponential Time;ACM Transactions on Algorithms;2022-03-04
2. Guest Column;ACM SIGACT News;2017-03-10
3. Bipartite perfect matching is in quasi-NC;Proceedings of the forty-eighth annual ACM symposium on Theory of Computing;2016-06-19
4. Dynamic programming for graphs on surfaces;ACM Transactions on Algorithms;2014-02
5. Revisiting the Equivalence Problem for Finite Multitape Automata;Automata, Languages, and Programming;2013