Proof Complexity of Symbolic QBF Reasoning

Mengel, Stefan; Slivovsky, Friedrich

doi:10.1007/978-3-030-80223-3_28

by Stefan Mengel, Friedrich Slivovsky

Reference:

Proof Complexity of Symbolic QBF ReasoningStefan Mengel, Friedrich SlivovskyTheory and Applications of Satisfiability Testing - SAT 2021 - 24th International Conference, Barcelona, Spain, July 5-9, 2021, Proceedings (Chu-Min Li, Felip Manyà, eds.), volume 12831 of Lecture Notes in Computer Science, pages 399–416, 2021, Springer Verlag.

Bibtex Entry:

@string{springer="Springer Verlag"}
@inproceedings{MengelS21,
  author    = {Stefan Mengel and
               Friedrich Slivovsky},
  editor    = {Chu{-}Min Li and
               Felip Many{\`{a}}},
  title     = {Proof Complexity of Symbolic {QBF} Reasoning},
  booktitle = {Theory and Applications of Satisfiability Testing - {SAT} 2021 - 24th
               International Conference, Barcelona, Spain, July 5-9, 2021, Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {12831},
  pages     = {399--416},
  publisher = {Springer},
  year      = {2021},
  url       = {https://doi.org/10.1007/978-3-030-80223-3\_28},
  doi       = {10.1007/978-3-030-80223-3\_28},
  keywords  = {l2solve}
}