Author:
Libkin Leonid,Wong Limsoon
Subject
General Computer Science,Theoretical Computer Science
Reference33 articles.
1. E. Allender, Circuit complexity before the dawn of the new millennium, in: Proc. 16th Conf. on Foundations of Software Technology and Theoretical Computer Science, Lecture Notes in Computer Science, Vol. 1180, Springer, Berlin, 1996, pp. 1–18.
2. On uniformity within NC1;Barrington;J. Comput. System Sci.,1990
3. M. Benedikt, H.J. Keisler, Expressive power of unary counters, in: Proc. Int. Conf. on Database Theory (ICDT’97), Lecture Notes in Computer Science, Vol. 1186, Springer, Berlin, January 1997.
4. On optimal lower bound on the number of variables for graph identification;Cai;Combinatorica,1992
5. Local properties of query languages;Dong;Theoret. Comput. Sci.,2000
Cited by
9 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献