@InProceedings{beyersdorff_et_al:LIPIcs.ITCS.2018.9,
  author =	{Beyersdorff, Olaf and Blinkhorn, Joshua and Hinde, Luke},
  title =	{{Size, Cost and Capacity: A Semantic Technique for Hard Random QBFs}},
  booktitle =	{9th Innovations in Theoretical Computer Science Conference (ITCS 2018)},
  pages =	{9:1--9:18},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-060-6},
  ISSN =	{1868-8969},
  year =	{2018},
  volume =	{94},
  editor =	{Karlin, Anna R.},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2018.9},
  URN =		{urn:nbn:de:0030-drops-83228},
  doi =		{10.4230/LIPIcs.ITCS.2018.9},
  annote =	{Keywords: quantified Boolean formulas, proof complexity, lower bounds}
}