On computational complexity of graph inference from counting

Szilárd Zsolt Fazekas, Hiro Ito, Yasushi Okuno, Shinnosuke Seki, Kei Taneishi. On computational complexity of graph inference from counting. Natural Computing, 12(4):589-603, 2013. [doi]

Abstract

Abstract is missing.