Pages that link to "Item:Q3118383"
From MaRDI portal
The following pages link to Logical complexity of graphs: a survey (Q3118383):
Displaying 6 items.
- Defining long words succinctly in FO and MSO (Q2104260) (← links)
- Bounds for the Quantifier Depth in Finite-Variable Logics (Q2946761) (← links)
- (Q3121527) (← links)
- Upper Bounds on the Quantifier Depth for Graph Differentiation in First Order Logic (Q4635884) (← links)
- The descriptive complexity of subgraph isomorphism without numerics (Q5919541) (← links)
- On the WL-dimension of circulant graphs of prime power order (Q6119507) (← links)