Hard QBFs for Merge Resolution

Olaf Beyersdorff, Joshua Blinkhorn, Meena Mahajan, Tomás Peitl, Gaurav Sood. Hard QBFs for Merge Resolution. Electronic Colloquium on Computational Complexity (ECCC), 27:188, 2020. [doi]

@article{BeyersdorffBMPS20-0,
  title = {Hard QBFs for Merge Resolution},
  author = {Olaf Beyersdorff and Joshua Blinkhorn and Meena Mahajan and Tomás Peitl and Gaurav Sood},
  year = {2020},
  url = {https://eccc.weizmann.ac.il/report/2020/188},
  researchr = {https://researchr.org/publication/BeyersdorffBMPS20-0},
  cites = {0},
  citedby = {0},
  journal = {Electronic Colloquium on Computational Complexity (ECCC)},
  volume = {27},
  pages = {188},
}