Schloss Dagstuhl - Leibniz-Zentrum für Informatik GmbH Schloss Dagstuhl - Leibniz-Zentrum für Informatik GmbH scholarly article en Andrews, Robert https://www.dagstuhl.de/lipics License: Creative Commons Attribution 3.0 Unported license (CC-BY 3.0)
when quoting this document, please refer to the following
DOI:
URN: urn:nbn:de:0030-drops-125895
URL:

Algebraic Hardness Versus Randomness in Low Characteristic

pdf-format:


Abstract

We show that lower bounds for explicit constant-variate polynomials over fields of characteristic p > 0 are sufficient to derandomize polynomial identity testing over fields of characteristic p. In this setting, existing work on hardness-randomness tradeoffs for polynomial identity testing requires either the characteristic to be sufficiently large or the notion of hardness to be stronger than the standard syntactic notion of hardness used in algebraic complexity. Our results make no restriction on the characteristic of the field and use standard notions of hardness. We do this by combining the Kabanets-Impagliazzo generator with a white-box procedure to take p-th roots of circuits computing a p-th power over fields of characteristic p. When the number of variables appearing in the circuit is bounded by some constant, this procedure turns out to be efficient, which allows us to bypass difficulties related to factoring circuits in characteristic p. We also combine the Kabanets-Impagliazzo generator with recent "bootstrapping" results in polynomial identity testing to show that a sufficiently-hard family of explicit constant-variate polynomials yields a near-complete derandomization of polynomial identity testing. This result holds over fields of both zero and positive characteristic and complements a recent work of Guo, Kumar, Saptharishi, and Solomon, who obtained a slightly stronger statement over fields of characteristic zero.

BibTeX - Entry

@InProceedings{andrews:LIPIcs:2020:12589,
  author =	{Robert Andrews},
  title =	{{Algebraic Hardness Versus Randomness in Low Characteristic}},
  booktitle =	{35th Computational Complexity Conference (CCC 2020)},
  pages =	{37:1--37:32},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-156-6},
  ISSN =	{1868-8969},
  year =	{2020},
  volume =	{169},
  editor =	{Shubhangi Saraf},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/opus/volltexte/2020/12589},
  URN =		{urn:nbn:de:0030-drops-125895},
  doi =		{10.4230/LIPIcs.CCC.2020.37},
  annote =	{Keywords: Polynomial identity testing, hardness versus randomness, low characteristic}
}

Keywords: Polynomial identity testing, hardness versus randomness, low characteristic
Seminar: 35th Computational Complexity Conference (CCC 2020)
Issue date: 2020
Date of publication: 17.07.2020


DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI