BibTeX record journals/lmcs/BednarczykD22

download as .bib file

@article{DBLP:journals/lmcs/BednarczykD22,
  author       = {Bartosz Bednarczyk and
                  St{\'{e}}phane Demri},
  title        = {Why Does Propositional Quantification Make Modal and Temporal Logics
                  on Trees Robustly Hard?},
  journal      = {Log. Methods Comput. Sci.},
  volume       = {18},
  number       = {3},
  year         = {2022},
  url          = {https://doi.org/10.46298/lmcs-18(3:5)2022},
  doi          = {10.46298/LMCS-18(3:5)2022},
  timestamp    = {Tue, 24 Jan 2023 10:48:24 +0100},
  biburl       = {https://dblp.org/rec/journals/lmcs/BednarczykD22.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.