The parameterized complexity of counting problems

Author(s):  
J. Flum ◽  
M. Grohe
2014 ◽  
Vol 19 (4) ◽  
pp. 410-420 ◽  
Author(s):  
Chihao Zhang ◽  
Yijia Chen

2004 ◽  
Vol 33 (4) ◽  
pp. 892-922 ◽  
Author(s):  
Jörg Flum ◽  
Martin Grohe

2021 ◽  
Vol 867 ◽  
pp. 1-12
Author(s):  
Lawqueen Kanesh ◽  
Soumen Maity ◽  
Komal Muluk ◽  
Saket Saurabh

1994 ◽  
Vol 25 (3) ◽  
pp. 122-123 ◽  
Author(s):  
Michael T. Hallett ◽  
H. Todd Wareham

2020 ◽  
Vol 847 ◽  
pp. 27-38
Author(s):  
Christian Komusiewicz ◽  
Mateus de Oliveira Oliveira ◽  
Meirav Zehavi

2021 ◽  
Vol 51 (4) ◽  
pp. 4-5
Author(s):  
Frederic Green

The three books reviewed in this column are about central ideas in algorithms, complexity, and geometry. The third one brings together topics from the first two by applying techniques of both property testing (the subject of the first book) and parameterized complexity (including its more focused incarnation studied in the second book, kernelization) to geometric problems.


2011 ◽  
Vol 412 (23) ◽  
pp. 2468-2485 ◽  
Author(s):  
Jin-Yi Cai ◽  
Pinyan Lu ◽  
Mingji Xia
Keyword(s):  

2002 ◽  
Vol 31 (4) ◽  
pp. 86-96 ◽  
Author(s):  
Martin Grohe

Sign in / Sign up

Export Citation Format

Share Document