Proof Complexity of Symbolic QBF Reasoning (bibtex)
by ,
Reference:
Proof Complexity of Symbolic QBF ReasoningStefan Mengel, Friedrich Slivovsky2021, Technical report AC-TR-21-011, Algorithms and Complexity Group, TU Wien.
Bibtex Entry:
@string{ac="Algorithms and Complexity Group, TU Wien"}
@TechReport{MengelSlivovsky21tr,
  author    = {Stefan Mengel and Friedrich Slivovsky},
  title     = {Proof Complexity of Symbolic QBF Reasoning},
  institution  = AC,
  year         = {2021},
  number       = {AC-TR-21-011},
  url          = {http://www.ac.tuwien.ac.at/files/tr/ac-tr-21-011.pdf},
}
Powered by bibtexbrowser