Search dblp for Publications

export results for "Computing the interleaving distance is NP-hard"

 download as .bib file

@article{DBLP:journals/focm/BjerkevikBK20,
  author       = {H{\aa}vard Bakke Bjerkevik and
                  Magnus Bakke Botnan and
                  Michael Kerber},
  title        = {Computing the Interleaving Distance is NP-Hard},
  journal      = {Found. Comput. Math.},
  volume       = {20},
  number       = {5},
  pages        = {1237--1271},
  year         = {2020},
  url          = {https://doi.org/10.1007/s10208-019-09442-y},
  doi          = {10.1007/S10208-019-09442-Y},
  timestamp    = {Mon, 03 Jan 2022 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/focm/BjerkevikBK20.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/abs-1811-09165,
  author       = {H{\aa}vard Bakke Bjerkevik and
                  Magnus Bakke Botnan and
                  Michael Kerber},
  title        = {Computing the interleaving distance is NP-hard},
  journal      = {CoRR},
  volume       = {abs/1811.09165},
  year         = {2018},
  url          = {http://arxiv.org/abs/1811.09165},
  eprinttype    = {arXiv},
  eprint       = {1811.09165},
  timestamp    = {Fri, 30 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1811-09165.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.