The Complexity of Approximately Counting Retractions to Square-free Graphs (Q5032031)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7475102
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The Complexity of Approximately Counting Retractions to Square-free Graphs |
scientific article; zbMATH DE number 7475102 |
Statements
The Complexity of Approximately Counting Retractions to Square-free Graphs (English)
0 references
16 February 2022
0 references
approximate counting
0 references
counting complexity
0 references
graph homomorphisms
0 references
retractions
0 references
square-free graphs
0 references
0 references
0 references
0 references
0.8663262
0 references
0 references
0.86005074
0 references
