by Johannes Klaus Fichte and Markus Hecher and Andreas Pfandler
Reference:
Lower Bounds for QBFs of Bounded TreewidthJohannes Klaus Fichte and Markus Hecher and Andreas PfandlerLICS '20: 35th Annual ACM/IEEE Symposium on Logic in Computer Science, Saarbrücken, Germany, July 8-11, 2020 (Holger Hermanns and Lijun Zhang and Naoki Kobayashi and Dale Miller, ed.), pages 410–424, 2020, ACM.
Bibtex Entry:
@inproceedings{FichteHP20,
keywords = "reveal",
author = {Johannes Klaus Fichte and Markus Hecher and Andreas Pfandler},
editor = {Holger Hermanns and Lijun Zhang and Naoki Kobayashi and Dale Miller},
title = {Lower Bounds for QBFs of Bounded Treewidth},
booktitle = {{LICS} '20: 35th Annual {ACM/IEEE} Symposium on Logic in Computer Science, Saarbr{\"{u}}cken, Germany, July 8-11, 2020},
pages = {410--424},
publisher = {{ACM}},
year = {2020},
doi = {10.1145/3373718.3394756},
xxxurl = {https://doi.org/10.1145/3373718.3394756 [doi.org]},
}