@InProceedings{kaminski_et_al:LIPIcs.MFCS.2021.66,
  author =	{Kaminski, Michael and Shparlinski, Igor E.},
  title =	{{Sets of Linear Forms Which Are Hard to Compute}},
  booktitle =	{46th International Symposium on Mathematical Foundations of Computer Science (MFCS 2021)},
  pages =	{66:1--66:22},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-201-3},
  ISSN =	{1868-8969},
  year =	{2021},
  volume =	{202},
  editor =	{Bonchi, Filippo and Puglisi, Simon J.},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2021.66},
  URN =		{urn:nbn:de:0030-drops-145065},
  doi =		{10.4230/LIPIcs.MFCS.2021.66},
  annote =	{Keywords: Linear algorithms, additive complexity, effective Perron theorem, effective Lindemann-Weierstrass theorem}
}