@InProceedings{itsykson_et_al:LIPIcs.SAT.2022.6,
  author =	{Itsykson, Dmitry and Riazanov, Artur and Smirnov, Petr},
  title =	{{Tight Bounds for Tseitin Formulas}},
  booktitle =	{25th International Conference on Theory and Applications of Satisfiability Testing (SAT 2022)},
  pages =	{6:1--6:21},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-242-6},
  ISSN =	{1868-8969},
  year =	{2022},
  volume =	{236},
  editor =	{Meel, Kuldeep S. and Strichman, Ofer},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SAT.2022.6},
  URN =		{urn:nbn:de:0030-drops-166805},
  doi =		{10.4230/LIPIcs.SAT.2022.6},
  annote =	{Keywords: Proof complexity, Tseitin formulas, treewidth, resolution, OBDD-based proof systems}
}