The Complexity of Homomorphism Indistinguishability. Böker, J., Chen, Y., Grohe, M., & Rattan, G. In 44th International Symposium on Mathematical Foundations of Computer Science, MFCS 2019, August 26-30, 2019, Aachen, Germany, pages 54:1–54:13, 2019.
The Complexity of Homomorphism Indistinguishability [link]Paper  doi  bibtex   
@inproceedings{DBLP:conf/mfcs/BokerCGR19,
  author    = {Jan B{\"{o}}ker and
               Yijia Chen and
               Martin Grohe and
               Gaurav Rattan},
  title     = {The Complexity of Homomorphism Indistinguishability},
  booktitle = {44th International Symposium on Mathematical Foundations of Computer
               Science, {MFCS} 2019, August 26-30, 2019, Aachen, Germany},
  pages     = {54:1--54:13},
  year      = {2019},
  crossref  = {DBLP:conf/mfcs/2019},
  url       = {https://doi.org/10.4230/LIPIcs.MFCS.2019.54},
  doi       = {10.4230/LIPIcs.MFCS.2019.54},
  timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/conf/mfcs/BokerCGR19.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}

Downloads: 0