Author:
Abu Zaid F.,Grädel E.,Grohe M.,Pakusa W.
Publisher
Springer Berlin Heidelberg
Reference17 articles.
1. Anderson, M., Dawar, A., Holm, B.: Maximum matching and linear programming in fixed-point logic with counting. In: LICS 2013, pp. 173–182 (2013)
2. Atserias, A., Bulatov, A., Dawar, A.: Affine systems of equations and counting infinitary logic. Theoretical Computer Science 410(18), 1666–1683 (2009)
3. Babai, L.: Monte-Carlo algorithms in graph isomorphism testing. Université de Montréal Technical Report, DMS, pp. 79–10 (1979)
4. Blass, A., Gurevich, Y., Shelah, S.: Choiceless polynomial time. Annals of Pure and Applied Logic 100(1), 141–187 (1999)
5. Blass, A., Gurevich, Y., Shelah, S.: On polynomial time computation over unordered structures. Journal of Symbolic Logic 67(3), 1093–1125 (2002)
Cited by
6 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献