Publisher
Springer International Publishing
Reference38 articles.
1. Anderson, M., Dawar, A., Holm, B.: Solving linear programs without breaking abstractions. J. ACM 62(6), 48:1–48:26 (2015)
2. Arvind, V., Fuhlbrück, F., Köbler, J., Verbitsky, O.: On Weisfeiler-Leman invariance: subgraph counts and related graph properties. Technical report (2018). https://arxiv.org/abs/1811.04801
3. Atserias, A., Bulatov, A.A., Dawar, A.: Affine systems of equations and counting infinitary logic. Theor. Comput. Sci. 410(18), 1666–1683 (2009)
4. Babai, L.: Graph isomorphism in quasipolynomial time. In: Proceedings of the 48th Annual ACM Symposium on Theory of Computing (STOC 2016), pp. 684–697 (2016). https://doi.org/10.1145/2897518.2897542
5. Babai, L., Erdős, P., Selkow, S.M.: Random graph isomorphism. SIAM J. Comput. 9(3), 628–635 (1980)
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献