Author:
Anderson Matthew,Dawar Anuj
Publisher
Springer Science and Business Media LLC
Subject
Computational Theory and Mathematics,Theoretical Computer Science
Reference20 articles.
1. Anderson, M., Dawar, A.: On symmetric circuits and fixed-point logics. In: 31st International Symposium on Theoretical Aspects of Computer Science, volume 25, pages 41–52 (2014)
2. Anderson, M., Dawar, A., Holm, B.: Maximum matching and linear programming in fixed-point logic with counting (2013)
3. Blass, A., Gurevich, Y., Shelah, S.: Choiceless polynomial time. Annals of Pure and Applied Logic 100, 141–187 (1999)
4. Cai, J-Y., Fürer, M., Immerman, N.: An optimal lower bound on the number of variables for graph identification. Combinatorica 12(4), 389–410 (1992)
5. Clote, P., Kranakis, E.: Boolean functions, invariance groups, and parallel complexity. SIAM J. Comput. 20(3), 553–590 (1991)
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献