On the exact learnability of graph parameters: The case of partition functions
From MaRDI portal
Publication:4608626
DOI10.4230/LIPICS.MFCS.2016.63zbMath1398.68266arXiv1606.04056OpenAlexW2964160034MaRDI QIDQ4608626
Nadia Labai, Johann A. Makowsky
Publication date: 21 March 2018
Full work available at URL: https://arxiv.org/abs/1606.04056
Computational learning theory (68Q32) Graph theory (including graph drawing) in computer science (68R10) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)
This page was built for publication: On the exact learnability of graph parameters: The case of partition functions