Hard QBFs for Merge Resolution

Beyersdorff, Olaf; Blinkhorn, Joshua; Mahajan, Meena; Peitl, Tomáš; Sood, Gaurav

doi:10.1145/3638263

by Olaf Beyersdorff, Joshua Blinkhorn, Meena Mahajan, Tomáš Peitl, Gaurav Sood

Reference:

Hard QBFs for Merge ResolutionOlaf Beyersdorff, Joshua Blinkhorn, Meena Mahajan, Tomáš Peitl, Gaurav SoodACM Trans. Comput. Theory, volume 16, number 2, pages 6:1–6:24, 2024.

Bibtex Entry:

@article{BeyersdorffBlinkhornMahajanPeitlSood24,
  author       = {Olaf Beyersdorff and
                  Joshua Blinkhorn and
                  Meena Mahajan and
                  Tom{\'{a}}{\v{s}} Peitl and
                  Gaurav Sood},
  title        = {Hard QBFs for Merge Resolution},
  journal      = {{ACM} Trans. Comput. Theory},
  volume       = {16},
  number       = {2},
  pages        = {6:1--6:24},
  year         = {2024},
  url          = {10.1145/3638263">https://doi.org/10.1145/3638263},
  doi          = {10.1145/3638263},
  timestamp    = {Tue, 08 Oct 2024 15:19:35 +0200},
  biburl       = {https://dblp.org/rec/journals/toct/BeyersdorffBMP024.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}