Graph Isomorphism, Sherali-Adams Relaxations and Expressibility in Counting Logics

Albert Atserias, Elitza N. Maneva. Graph Isomorphism, Sherali-Adams Relaxations and Expressibility in Counting Logics. Electronic Colloquium on Computational Complexity (ECCC), 18:77, 2011. [doi]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.