A computational framework for the study of partition functions and graph polynomials (Q5737993)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A computational framework for the study of partition functions and graph polynomials |
scientific article; zbMATH DE number 6724440
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A computational framework for the study of partition functions and graph polynomials |
scientific article; zbMATH DE number 6724440 |
Statements
A Computational Framework for the Study of Partition Functions and Graph Polynomials (English)
0 references
31 May 2017
0 references
graph polynomials
0 references
partition functions
0 references
models of computation
0 references
complexity of computation
0 references
counting problems
0 references
0.7748974561691284
0 references
0.7621522545814514
0 references
0.7605555653572083
0 references
0.7603613138198853
0 references
0.759782075881958
0 references
