BibTeX record journals/corr/abs-1203-3706

download as .bib file

@article{DBLP:journals/corr/abs-1203-3706,
  author       = {Fran{\c{c}}ois Hantry and
                  Lakhdar Sa{\"{\i}}s and
                  Mohand{-}Said Hacid},
  title        = {On the Complexity of Computing Minimal Unsatisfiable {LTL} formulas},
  journal      = {CoRR},
  volume       = {abs/1203.3706},
  year         = {2012},
  url          = {http://arxiv.org/abs/1203.3706},
  eprinttype    = {arXiv},
  eprint       = {1203.3706},
  timestamp    = {Mon, 13 Aug 2018 16:47:04 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1203-3706.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.