scientific article; zbMATH DE number 1305047
From MaRDI portal
Publication:4251980
zbMath0940.68064MaRDI QIDQ4251980
Publication date: 17 June 1999
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Parallel algorithms in computer science (68W10) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)
Related Items (6)
Solving large FPT problems on coarse-grained parallel machines ⋮ On the Parameterized Parallel Complexity and the Vertex Cover Problem ⋮ Confronting intractability via parameters ⋮ Modular-Width: An Auxiliary Parameter for Parameterized Parallel Complexity ⋮ Computing hitting set kernels by \(\mathrm{AC}^0\)-circuits ⋮ The Monotone Circuit Value Problem with Bounded Genus Is in NC
This page was built for publication:
