The following pages link to (Q3830533):
Displaying 20 items.
- Methods for proving completeness via logical reductions (Q685391) (← links)
- Finite-model theory -- A personal perspective (Q688663) (← links)
- A note on the approximation of the MAX CLIQUE problem (Q1183423) (← links)
- The invariant problem for binary string structures and the parallel complexity theory of queries (Q1191022) (← links)
- Capturing complexity classes by fragments of second-order logic (Q1193408) (← links)
- Query languages for hierarchic databases (Q1201723) (← links)
- On winning strategies in Ehrenfeucht-Fraïssé games (Q1269907) (← links)
- A restricted second order logic for finite structures (Q1271559) (← links)
- Reachability and the power of local ordering (Q1367543) (← links)
- How to define a linear order on finite models (Q1371431) (← links)
- Dyn-FO: A parallel, dynamic complexity class (Q1376403) (← links)
- Metafinite model theory (Q1383163) (← links)
- \(\Delta\)-languages for sets and LOGSPACE computable graph transformers (Q1392148) (← links)
- The closure of monadic NP (Q1577017) (← links)
- Hierarchies in transitive closure logic, stratified Datalog and infinitary logic (Q1919531) (← links)
- Computing on structures (Q4630296) (← links)
- Tailoring recursion for complexity (Q4632420) (← links)
- Implicit definability and infinitary logic in finite model theory (Q4645216) (← links)
- The complexity of graph connectivity (Q5096823) (← links)
- On the complexity of some problems on groups input as multiplication tables (Q5956010) (← links)
