The following pages link to (Q4251980):
Displaying 9 items.
- Confronting intractability via parameters (Q465686) (← links)
- Computing functions with parallel queries to NP (Q673784) (← links)
- Solving large FPT problems on coarse-grained parallel machines (Q1877701) (← links)
- Computing hitting set kernels by \(\mathrm{AC}^0\)-circuits (Q1987509) (← links)
- Efficient parallel algorithms for parameterized problems (Q2319897) (← links)
- The Monotone Circuit Value Problem with Bounded Genus Is in NC (Q2817851) (← links)
- On the Parameterized Parallel Complexity and the Vertex Cover Problem (Q2958339) (← links)
- Expressibility and Parallel Complexity (Q4207580) (← links)
- Modular-Width: An Auxiliary Parameter for Parameterized Parallel Complexity (Q4632210) (← links)
