Pages that link to "Item:Q705070"
From MaRDI portal
The following pages link to Learnability and definability in trees and similar structures (Q705070):
Displaying 7 items.
- Vapnik-Chervonenkis dimension and density on Johnson and Hamming graphs (Q831858) (← links)
- Interpreting nowhere dense graph classes as a classical notion of model theory (Q2441640) (← links)
- Containment of Monadic Datalog Programs via Bounded Clique-Width (Q3449494) (← links)
- (Q5089253) (← links)
- (Q5091140) (← links)
- On low rank-width colorings (Q5918207) (← links)
- Model checking on interpretations of classes of bounded local cliquewidth (Q6649489) (← links)
