ملف الباحث

Nina Runde

ورقة واحدة في مجموعة PaperMetrix

المنشورات

أوراق هذا المؤلف

  1. The Complexity of Homomorphism Reconstructibility

    2023 · arXiv (Cornell University)

    Representing graphs by their homomorphism counts has led to the beautiful theory of homomorphism indistinguishability in recent years. Moreover, homomorphism counts have promising applications in database theory and machine learning, where one would like to …