BibTeX record journals/corr/abs-1905-00073

download as .bib file

@article{DBLP:journals/corr/abs-1905-00073,
  author       = {Magali Bardet and
                  Ayoub Otmani and
                  Mohamed Saeed{-}Taha},
  title        = {Permutation Code Equivalence is not Harder than Graph Isomorphism
                  when Hulls are Trivial},
  journal      = {CoRR},
  volume       = {abs/1905.00073},
  year         = {2019},
  url          = {http://arxiv.org/abs/1905.00073},
  eprinttype    = {arXiv},
  eprint       = {1905.00073},
  timestamp    = {Mon, 27 May 2019 13:15:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1905-00073.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

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.