BibTeX record conf/sat/MiksaN14

download as .bib file

@inproceedings{DBLP:conf/sat/MiksaN14,
  author    = {Mladen Miksa and
               Jakob Nordstr{\"{o}}m},
  title     = {Long Proofs of (Seemingly) Simple Formulas},
  booktitle = {Theory and Applications of Satisfiability Testing - {SAT} 2014 - 17th
               International Conference, Held as Part of the Vienna Summer of Logic,
               {VSL} 2014, Vienna, Austria, July 14-17, 2014. Proceedings},
  pages     = {121--137},
  year      = {2014},
  crossref  = {DBLP:conf/sat/2014},
  url       = {https://doi.org/10.1007/978-3-319-09284-3\_10},
  doi       = {10.1007/978-3-319-09284-3\_10},
  timestamp = {Tue, 14 May 2019 10:00:41 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/sat/MiksaN14},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/sat/2014,
  editor    = {Carsten Sinz and
               Uwe Egly},
  title     = {Theory and Applications of Satisfiability Testing - {SAT} 2014 - 17th
               International Conference, Held as Part of the Vienna Summer of Logic,
               {VSL} 2014, Vienna, Austria, July 14-17, 2014. Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {8561},
  publisher = {Springer},
  year      = {2014},
  url       = {https://doi.org/10.1007/978-3-319-09284-3},
  doi       = {10.1007/978-3-319-09284-3},
  isbn      = {978-3-319-09283-6},
  timestamp = {Tue, 14 May 2019 10:00:41 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/sat/2014},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of Schloss Dagstuhl - Leibniz Center for Informatics