Parallel Multivariate Meta-Theorems

DOI10.4230/LIPICS.IPEC.2016.4MaRDI QIDQ4634387zbMATH OpenOpenAlexFDO

Authors Max Bannach, Till Tantau

Publication date 10 April 2018

Full work available at URL https://doi.org/10.4230/LIPIcs.IPEC.2016.4

zbMATH Keywords

parallel computationFPTtree widthtree depthmeta-theorems

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Specification and verification (program logics, model checking, etc.) (68Q60) Parallel algorithms in computer science (68W10)

Recommendations

• scientific article; zbMATH DE number 1552517
• scientific article; zbMATH DE number 1382857
• Multilinear algebra and parallel programming
• scientific article; zbMATH DE number 1501234
• On the parallel evaluation of multivariate polynomials
• scientific article; zbMATH DE number 4068238
• A parallel multi-p method
• Parallel cooperative propositional theorem proving
• scientific article; zbMATH DE number 882116
• scientific article; zbMATH DE number 4047184

Cited in

(6)

• Computing hitting set kernels by \(\mathrm{AC}^0\)-circuits
• Fast parallel fixed-parameter algorithms via color coding
• Computing Hitting Set Kernels By AC^0-Circuits
• On the parallel parameterized complexity of MaxSAT variants
• On the descriptive complexity of color coding
• Computing kernels in parallel: lower and upper bounds

This page was built for publication: Parallel Multivariate Meta-Theorems

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