Parameterized parallel complexity

DOI10.1007/BFB0057945MaRDI QIDQ4251980zbMATH OpenFDO

Authors Marco Cesati, Miriam Di Ianni

Publication date 17 June 1999

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BFB0057945

zbMATH Keywords

parallel complexity

Mathematics Subject Classification ID

Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Analysis of algorithms and problem complexity (68Q25) Parallel algorithms in computer science (68W10)

Cited in

(9)

• Solving large FPT problems on coarse-grained parallel machines
• Computing hitting set kernels by \(\mathrm{AC}^0\)-circuits
• Efficient parallel algorithms for parameterized problems
• The monotone circuit value problem with bounded genus is in NC
• On the parameterized parallel complexity and the vertex cover problem
• Expressibility and Parallel Complexity
• Modular-width: an auxiliary parameter for parameterized parallel complexity
• Confronting intractability via parameters
• Computing functions with parallel queries to NP

This page was built for publication: Parameterized parallel complexity

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4251980)