Publication:2753688
From MaRDI portal
zbMath0973.68524MaRDI QIDQ2753688
Klaus Meer, Johann A. Makowsky
Publication date: 3 December 2001
05A10: Factorials, binomial coefficients, combinatorial functions
68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)
68Q15: Complexity classes (hierarchies, relations among complexity classes, etc.)
Related Items
On the fixed parameter complexity of graph enumeration problems definable in monadic second-order logic, From a zoo to a zoology: Towards a general theory of graph polynomials, On the algebraic complexity of some families of coloured Tutte polynomials, Coloured Tutte polynomials and Kauffman brackets for graphs of bounded tree width