@InProceedings{williams:OASIcs.SOSA.2018.6,
  author =	{Williams, R. Ryan},
  title =	{{Counting Solutions to Polynomial Systems via Reductions}},
  booktitle =	{1st Symposium on Simplicity in Algorithms (SOSA 2018)},
  pages =	{6:1--6:15},
  series =	{Open Access Series in Informatics (OASIcs)},
  ISBN =	{978-3-95977-064-4},
  ISSN =	{2190-6807},
  year =	{2018},
  volume =	{61},
  editor =	{Seidel, Raimund},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.SOSA.2018.6},
  URN =		{urn:nbn:de:0030-drops-83078},
  doi =		{10.4230/OASIcs.SOSA.2018.6},
  annote =	{Keywords: counting complexity, polynomial equations, finite field, derandomization, strong exponential time hypothesis}
}