Similar Items: On the First-Order Complexity of Induced Subgraph Isomorphism
- Isomorphisms of types in the presence of higher-order references (extended version)
- Definable isomorphism problem
- Optimal Hardness of Online Algorithms for Large Common Induced Subgraphs
- Type Isomorphisms for Multiplicative-Additive Linear Logic
- Termination of Graph Transformation Systems Using Weighted Subgraph Counting
- A proof system for graph (non)-isomorphism verification