The following pages link to Martin Grohe (Q414932):
Displaying 50 items.
- Enumerating homomorphisms (Q414933) (← links)
- Machine-based methods in parameterized complexity theory (Q557897) (← links)
- Learnability and definability in trees and similar structures (Q705070) (← links)
- Reachability and connectivity queries in constraint databases (Q1394800) (← links)
- The hardness of embedding grids and walls (Q1687915) (← links)
- Bounds and algorithms for joins via fractional edge covers (Q1799311) (← links)
- Describing parameterized complexity classes (Q1877556) (← links)
- The complexity of first-order and monadic second-order logic revisited (Q1886318) (← links)
- An existential locality theorem (Q1887659) (← links)
- Computing crossing numbers in quadratic time (Q1887712) (← links)
- A double arity hierarchy theorem for transitive closure logic (Q1913297) (← links)
- Constraint satisfaction with succinctly specified relations (Q1959431) (← links)
- Equivalence in finite-variable logics is complete for polynomial time (Q1977423) (← links)
- Database query processing using finite cursor machines (Q2272221) (← links)
- Tight lower bounds for query processing on streaming and external memory data (Q2373746) (← links)
- Bounded fixed-parameter tractability and reducibility (Q2382273) (← links)
- Tight lower and upper bounds for the complexity of canonical colour refinement (Q2398207) (← links)
- Hypertree width and related hypergraph invariants (Q2461773) (← links)
- Parametrized complexity theory. (Q2488567) (← links)
- Local tree-width, excluded minors, and approximation algorithms (Q2494422) (← links)
- Large finite structures with few \(L^k\)-types (Q2506492) (← links)
- On tree width, bramble size, and expansion (Q2519023) (← links)
- Arity hierarchies (Q2563982) (← links)
- The complexity of partition functions (Q2581263) (← links)
- Bounded fixed-parameter tractability and \(\log^{2}n\) nondeterministic bits (Q2581756) (← links)
- Fixed-parameter tractability, definability, and model-checking (Q2719133) (← links)
- (Q2762493) (← links)
- Tangles and Connectivity in Graphs (Q2798707) (← links)
- Colouring and Covering Nowhere Dense Graphs (Q2827820) (← links)
- Tight Lower and Upper Bounds for the Complexity of Canonical Colour Refinement (Q2849306) (← links)
- Size bounds and query plans for relational joins (Q2862210) (← links)
- L-recursion and a new logic for logarithmic space (Q2915689) (← links)
- Dimension Reduction via Colour Refinement (Q2921438) (← links)
- Choiceless Polynomial Time on Structures with Small Abelian Colour Classes (Q2922002) (← links)
- Is Polynomial Time Choiceless? (Q2947174) (← links)
- (Q2963895) (← links)
- Where First-Order and Monadic Second-Order Logic Coincide (Q2986803) (← links)
- (Q3086928) (← links)
- (Q3118384) (← links)
- (Q3118386) (← links)
- Isomorphism testing for embeddable graphs through definability (Q3191972) (← links)
- Deciding first-order properties of locally tree-decomposable structures (Q3196630) (← links)
- Preservation under Extensions on Well-Behaved Finite Structures (Q3395035) (← links)
- (Q3396009) (← links)
- Limitations of Algebraic Approaches to Graph Isomorphism Testing (Q3448781) (← links)
- PEBBLE GAMES AND LINEAR EQUATIONS (Q3450805) (← links)
- Lower bounds for processing data with few random accesses to external memory (Q3452210) (← links)
- Query evaluation via tree-decompositions (Q3455547) (← links)
- On Parameterized Approximability (Q3499729) (← links)
- An Isomorphism Between Subexponential and Parameterized Complexity Theory (Q3519395) (← links)
