A Computational Framework for the Study of Partition Functions and Graph Polynomials

DOI10.1142/9789814449274_0012zbMath1364.03055OpenAlexW4229671577MaRDI QIDQ5737993

Tomer Kotek, Elena V. Ravve, Johann A. Makowsky

Publication date: 31 May 2017

Published in: Proceedings of the 12th Asian Logic Conference (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/9789814449274_0012

zbMATH Keywords

partition functionsgraph polynomialscomplexity of computationcounting problemsmodels of computation

Mathematics Subject Classification ID

Complexity of computation (including implicit computational complexity) (03D15) Recursive functions and relations, subrecursive hierarchies (03D20)

Related Items (3)

On the complexity of generalized chromatic polynomials ⋮ A logician's view of graph polynomials ⋮ Semantic Equivalence of Graph Polynomials Definable in Second Order Logic

This page was built for publication: A Computational Framework for the Study of Partition Functions and Graph Polynomials