Author:
Dawar A.,Lindell S.,Weinstein S.
Subject
Computational Theory and Mathematics,Computer Science Applications,Information Systems,Theoretical Computer Science
Cited by
54 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Game Comonads & Generalised Quantifiers;Logical Methods in Computer Science;2024-07-23
2. Constraint Satisfaction, Graph Isomorphism, and the Pebbling Comonad;Samson Abramsky on Logic and Structure in Computer Science and Beyond;2023
3. Relational Complexity and Higher Order Logics;Lecture Notes in Computer Science;2016
4. Universal Covers, Color Refinement, and Two-Variable Counting Logic: Lower Bounds for the Depth;2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science;2015-07
5. On complexity of Ehrenfeucht–Fraïssé games;Annals of Pure and Applied Logic;2009-12