The parameterized complexity of counting problems

DOI10.1109/SFCS.2002.1181978MaRDI QIDQ7255083zbMATH OpenFDO

Authors Jörg Flum, Martin Grohe

Publication date 29 May 2026

Full work available at URL https://doi.org/10.1109/SFCS.2002.1181978

Mathematics Subject Classification ID

Computer science (68-XX)

This page was built for publication: The parameterized complexity of counting problems

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