4 citations · 8 across the 9 of their papers we have counts for
Showing 2024Show all
2 papers · 1 filter
quant-ph2024
NPA Hierarchy for Quantum Isomorphism and Homomorphism Indistinguishability
Prem Nigam Kar, David E. Roberson, Tim Seppelt +1
Mančinska and Roberson [FOCS'20] showed that two graphs are quantum isomorphic if and only if they admit the same number of homomorphisms from any planar graph. Atserias et al. [JC…
cs.LO2024
An Algorithmic Meta Theorem for Homomorphism Indistinguishability
Tim Seppelt
Two graphs and are homomorphism indistinguishable over a family of graphs if for all graphs the number of homomorphisms from to is…