Go to the corresponding LIPIcs Volume Portal 
Labai, Nadia ; Makowsky, Johann A.
pdfformat: 

@InProceedings{labai_et_al:LIPIcs:2016:6475, author = {Nadia Labai and Johann A. Makowsky}, title = {{On the Exact Learnability of Graph Parameters: The Case of Partition Functions}}, booktitle = {41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016)}, pages = {63:163:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {9783959770163}, ISSN = {18688969}, year = {2016}, volume = {58}, editor = {Piotr Faliszewski and Anca Muscholl and Rolf Niedermeier}, publisher = {Schloss DagstuhlLeibnizZentrum fuer Informatik}, address = {Dagstuhl, Germany}, URL = {http://drops.dagstuhl.de/opus/volltexte/2016/6475}, URN = {urn:nbn:de:0030drops64750}, doi = {10.4230/LIPIcs.MFCS.2016.63}, annote = {Keywords: exact learning, partition function, weighted homomorphism, connection matrices} }
Keywords:  exact learning, partition function, weighted homomorphism, connection matrices  
Collection:  41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016)  
Issue Date:  2016  
Date of publication:  19.08.2016 