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]

@article{AtseriasM11,
  title = {Graph Isomorphism, Sherali-Adams Relaxations and Expressibility in Counting Logics},
  author = {Albert Atserias and Elitza N. Maneva},
  year = {2011},
  url = {http://eccc.hpi-web.de/report/2011/077},
  tags = {graph-rewriting, logic, rewriting logic, rewriting},
  researchr = {https://researchr.org/publication/AtseriasM11},
  cites = {0},
  citedby = {0},
  journal = {Electronic Colloquium on Computational Complexity (ECCC)},
  volume = {18},
  pages = {77},
}