On the complexity of powering in finite fields

DOI10.1145/1993636.1993702zbMath1288.68096OpenAlexW2159268377MaRDI QIDQ5419119

Swastik Kopparty

Publication date: 5 June 2014

Published in: Proceedings of the forty-third annual ACM symposium on Theory of computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1993636.1993702

zbMATH Keywords

Paley graphfinite fieldscircuit complexitypseudorandomnessRazborov-Smolensky

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Number-theoretic algorithms; complexity (11Y16) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (2)

Unnamed Item ⋮ Pseudorandom Generators from the Second Fourier Level and Applications to AC0 with Parity Gates

This page was built for publication: On the complexity of powering in finite fields