%0 Journal Article %1 journals/nc/FazekasIOST13 %A Fazekas, Szilárd Zsolt %A Ito, Hiro %A Okuno, Yasushi %A Seki, Shinnosuke %A Taneishi, Kei %D 2013 %J Nat. Comput. %K dblp %N 4 %P 589-603 %T On computational complexity of graph inference from counting. %U http://dblp.uni-trier.de/db/journals/nc/nc12.html#FazekasIOST13 %V 12

@article{journals/nc/FazekasIOST13, added-at = {2020-04-02T00:00:00.000+0200}, author = {Fazekas, Szilárd Zsolt and Ito, Hiro and Okuno, Yasushi and Seki, Shinnosuke and Taneishi, Kei}, biburl = {https://www.bibsonomy.org/bibtex/2730fbc6898475668488cc9aba1ed2f40/dblp}, ee = {https://doi.org/10.1007/s11047-012-9349-2}, interhash = {3d8c37f20b4c0a6760c9e2933b0222d5}, intrahash = {730fbc6898475668488cc9aba1ed2f40}, journal = {Nat. Comput.}, keywords = {dblp}, number = 4, pages = {589-603}, timestamp = {2020-04-03T12:00:36.000+0200}, title = {On computational complexity of graph inference from counting.}, url = {http://dblp.uni-trier.de/db/journals/nc/nc12.html#FazekasIOST13}, volume = 12, year = 2013 }