On the exact learnability of graph parameters: the case of partition functions (Q4608626)
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 6851896
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the exact learnability of graph parameters: the case of partition functions |
scientific article; zbMATH DE number 6851896 |
Statements
21 March 2018
0 references
exact learning
0 references
partition function
0 references
weighted homomorphism
0 references
connection matrices
0 references
On the Exact Learnability of Graph Parameters: The Case of Partition Functions (English)
0 references
0.7197127938270569
0 references
0.7165930271148682
0 references
0.7027912139892578
0 references
0.6997728943824768
0 references
