Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Parallel Multivariate Meta-Theorems

From MaRDI portal
Publication:4634387
Jump to:navigation, search

DOI10.4230/LIPIcs.IPEC.2016.4zbMath1398.68212OpenAlexW2594530162MaRDI QIDQ4634387

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 computationtree widthFPTtree depthmeta-theorems


Mathematics Subject Classification ID

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


Related Items (4)

Computing Hitting Set Kernels By AC^0-Circuits ⋮ Unnamed Item ⋮ Computing hitting set kernels by \(\mathrm{AC}^0\)-circuits ⋮ On the Descriptive Complexity of Color Coding




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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:4634387&oldid=18811726"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 7 February 2024, at 16:17.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki