@InProceedings{tantau:LIPIcs.CCC.2022.2,
  author =	{Tantau, Till},
  title =	{{On the Satisfaction Probability of k-CNF Formulas}},
  booktitle =	{37th Computational Complexity Conference (CCC 2022)},
  pages =	{2:1--2:27},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-241-9},
  ISSN =	{1868-8969},
  year =	{2022},
  volume =	{234},
  editor =	{Lovett, Shachar},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2022.2},
  URN =		{urn:nbn:de:0030-drops-165648},
  doi =		{10.4230/LIPIcs.CCC.2022.2},
  annote =	{Keywords: Satisfaction probability, majority it\{k\}-sat, kernelization, well orderings, locality}
}