Parameterised counting complexity theory

A little more than two decades ago, Flum and Grohe (STOC 02), and McCartin (MFCS 02) introduced the structural foundations of parameterised counting complexity theory with the goal of applying and generalising the extensive toolkit of parameterised algorithmics to the world of counting. Counting pro...

Full description

Bibliographic Details

Published in:	Computer science review Vol. 59; p. 100837
Main Author:	Roth, Marc
Format:	Journal Article
Language:	English
Published:	Elsevier Inc 01.02.2026
Subjects:	Counting problems Graph homomorphisms Graph motif parameters Parameterised complexity theory Randomised and approximation algorithms Randomised and approximation algorithms Graph homomorphisms Counting problems Parameterised complexity theory Graph motif parameters
ISSN:	1574-0137
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!