A complexity dichotomy for hypergraph partition functions (Q626694): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
(6 intermediate revisions by 5 users not shown) | |||
Property / author | |||
Property / author: Mark R. Jerrum / rank | |||
Property / author | |||
Property / author: Mark R. Jerrum / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2011398524 / rank | |||
Normal rank | |||
Property / Wikidata QID | |||
Property / Wikidata QID: Q56323827 / rank | |||
Normal rank | |||
Property / arXiv ID | |||
Property / arXiv ID: 0811.0037 / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 16:31, 18 April 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A complexity dichotomy for hypergraph partition functions |
scientific article |
Statements
A complexity dichotomy for hypergraph partition functions (English)
0 references
18 February 2011
0 references
complexity of counting homomorphisms
0 references
dichotomy theorem
0 references