Author:
Grädel Erich,Grohe Martin
Publisher
Springer International Publishing
Reference27 articles.
1. Lecture Notes in Computer Science;F Abu Zaid,2014
2. Anderson, M., Dawar, A.: On symmetric circuits and fixed-point logics. In: STACS, pp. 41–52 (2014)
3. Atserias, A., Bulatov, A., Dawar, A.: Affine systems of equations and counting infinitary logic. Theor. Comput. Sci. 410, 1666–1683 (2009)
4. Berkholz, C., Grohe, M.: Limitations of algebraic approaches to graph isomorphism testing (2015). arXiv: arXiv:1502.05912 [cs.CC]
5. Blass, A., Gurevich, Y.: Strong extension axioms and shelah’s zero-one law for choiceless polynomial time. J. Symb. Logic 68(1), 65–131 (2003)
Cited by
10 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Choiceless Polynomial Time with Witnessed Symmetric Choice;Journal of the ACM;2024-04-12
2. Simulating Logspace-Recursion with Logarithmic Quantifier Depth;2023 38th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS);2023-06-26
3. Separating Rank Logic from Polynomial Time;Journal of the ACM;2023-03-25
4. Separating Rank Logic from Polynomial Time;2021 36th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS);2021-06-29
5. Tight Bounds on the Asymptotic Descriptive Complexity of Subgraph Isomorphism;ACM Transactions on Computational Logic;2019-04-04