BibTeX record journals/logcom/Demey18

download as .bib file

@article{DBLP:journals/logcom/Demey18,
  author       = {Lorenz Demey},
  title        = {Computing the maximal Boolean complexity of families of Aristotelian
                  diagrams},
  journal      = {J. Log. Comput.},
  volume       = {28},
  number       = {6},
  pages        = {1323--1339},
  year         = {2018},
  url          = {https://doi.org/10.1093/logcom/exy015},
  doi          = {10.1093/LOGCOM/EXY015},
  timestamp    = {Mon, 10 Sep 2018 12:56:19 +0200},
  biburl       = {https://dblp.org/rec/journals/logcom/Demey18.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.