Pages that link to "Item:Q1263576"
From MaRDI portal
The following pages link to First-order definability on finite structures (Q1263576):
Displaying 7 items.
- Lower bounds for recognizing small cliques on CRCW PRAM's (Q919820) (← links)
- Some lower bounds in parameterized \(\mathrm{AC}^{0}\) (Q2417855) (← links)
- Typed Monoids – An Eilenberg-Like Theorem for Non Regular Languages (Q3014933) (← links)
- Formulas versus Circuits for Small Distance Connectivity (Q4554075) (← links)
- (Q4638077) (← links)
- The complexity of graph connectivity (Q5096823) (← links)
- Positive predicate structures for continuous data (Q5740676) (← links)