BibTeX record conf/latin/Furer12

download as .bib file

@inproceedings{DBLP:conf/latin/Furer12,
  author       = {Martin F{\"{u}}rer},
  editor       = {David Fern{\'{a}}ndez{-}Baca},
  title        = {Efficient Arbitrary and Resolution Proofs of Unsatisfiability for
                  Restricted Tree-Width},
  booktitle    = {{LATIN} 2012: Theoretical Informatics - 10th Latin American Symposium,
                  Arequipa, Peru, April 16-20, 2012. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {7256},
  pages        = {387--398},
  publisher    = {Springer},
  year         = {2012},
  url          = {https://doi.org/10.1007/978-3-642-29344-3\_33},
  doi          = {10.1007/978-3-642-29344-3\_33},
  timestamp    = {Mon, 05 Feb 2024 20:35:34 +0100},
  biburl       = {https://dblp.org/rec/conf/latin/Furer12.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.