Pages that link to "Item:Q3608406"
From MaRDI portal
The following pages link to The Power of Counting Logics on Restricted Classes of Finite Structures (Q3608406):
Displaying 8 items.
- Lower bounds for invariant queries in logics with counting. (Q1853505) (← links)
- Countably many weakenings of Belnap-Dunn logic (Q2307298) (← links)
- On fixed-point logic with counting (Q4508261) (← links)
- The Power of the Weisfeiler--Leman Algorithm to Decompose Graphs (Q5028356) (← links)
- The Power of the Weisfeiler-Leman Algorithm to Decompose Graphs (Q5092407) (← links)
- Benchmark Graphs for Practical Graph Isomorphism (Q5111749) (← links)
- A logical characterization of the counting hierarchy (Q5277825) (← links)
- CFI Construction and Balanced Graphs (Q5321700) (← links)
