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...

Celý popis

Podrobná bibliografia

Vydané v:	Computer science review Ročník 59; s. 100837
Hlavný autor:	Roth, Marc
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Elsevier Inc 01.02.2026
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!