BibTeX record conf/sat/SlivovskyS20

download as .bib file

@inproceedings{DBLP:conf/sat/SlivovskyS20,
  author       = {Friedrich Slivovsky and
                  Stefan Szeider},
  editor       = {Luca Pulina and
                  Martina Seidl},
  title        = {A Faster Algorithm for Propositional Model Counting Parameterized
                  by Incidence Treewidth},
  booktitle    = {Theory and Applications of Satisfiability Testing - {SAT} 2020 - 23rd
                  International Conference, Alghero, Italy, July 3-10, 2020, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {12178},
  pages        = {267--276},
  publisher    = {Springer},
  year         = {2020},
  url          = {https://doi.org/10.1007/978-3-030-51825-7\_19},
  doi          = {10.1007/978-3-030-51825-7\_19},
  timestamp    = {Sun, 04 Aug 2024 19:41:49 +0200},
  biburl       = {https://dblp.org/rec/conf/sat/SlivovskyS20.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.