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