0 citations0 referencesGoogle Scholardoi.orgSufficient completeness and parameterized proofs by inductionLecture notes in computer science·1994·pp. 23–40Adel BouhoulaRelated Papers→ PARAMETERIZED COMPLEXITY THEORY(2006)575 cited→ Parameterized counting problems(2005)24 cited→ Parameterized Counting Problems(2002)7 cited→ On the parameterized complexity of approximate counting(2011)3 cited→ Identification of Invariants of (Over)Parameterized Models(2012)