Parameterized Complexity of Fixed Variable Logics

DOI10.4230/LIPIcs.FSTTCS.2014.109zbMath1360.68491OpenAlexW2259552592MaRDI QIDQ2978506

Michael Elberfeld, Christoph Berkholz

Publication date: 25 April 2017

Full work available at URL: https://doi.org/10.4230/LIPIcs.FSTTCS.2014.109

zbMATH Keywords

first-order logicparameterized complexitypolynomial spacepebble gamesregular resolutions

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Specification and verification (program logics, model checking, etc.) (68Q60) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

This page was built for publication: Parameterized Complexity of Fixed Variable Logics