2 hasil untuk "David E. Roberson"
Menampilkan 1–2 · 0,35 detik · RSS
-
Artikel Jurnal
Lasserre Hierarchy for Graph Isomorphism and Homomorphism Indistinguishability
We show that feasibility of the $t^\text{th}$ level of the Lasserre semidefinite programming hierarchy for graph isomorphism can be expressed as a homomorphism indistinguishability relation. In other words, we define a class $\mathcal{L}_t$ of graphs such that graphs $G$ and $H$ are not…
-
Artikel Jurnal
NPA Hierarchy for Quantum Isomorphism and Homomorphism Indistinguishability
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. [JCTB'19] proved that quantum isomorphism is undecidable in general, which motivates the study of its relaxations. In the…