The following pages link to (Q4227581):
Displaying 15 items.
- On Weisfeiler-Leman invariance: subgraph counts and related graph properties (Q5918849) (← links)
- The descriptive complexity of subgraph isomorphism without numerics (Q5919541) (← links)
- The descriptive complexity approach to LOGCFL (Q5946058) (← links)
- On the complexity of some problems on groups input as multiplication tables (Q5956010) (← links)
- Alternating (in)dependence-friendly logic (Q6076360) (← links)
- Inductive definitions in logic versus programs of real-time cellular automata (Q6122593) (← links)
- Fixed points and attractors of reactantless and inhibitorless reaction systems (Q6140358) (← links)
- Sublinear-Time Language Recognition and Decision by One-Dimensional Cellular Automata (Q6169898) (← links)
- Substitution Principle and semidirect products (Q6190406) (← links)
- Logical characterizations of algebraic circuit classes over integral domains (Q6620024) (← links)
- Game characterizations for the number of quantifiers (Q6620026) (← links)
- Cutting planes width and the complexity of graph isomorphism refutations (Q6636618) (← links)
- A fixed-point theorem for Horn formula equations (Q6647303) (← links)
- Weighted automata and logics meet computational complexity (Q6647756) (← links)
- Separating LREC from LFP (Q6649491) (← links)
