On the complexity of powering in finite fields

Swastik Kopparty. On the complexity of powering in finite fields. In Lance Fortnow, Salil P. Vadhan, editors, Proceedings of the 43rd ACM Symposium on Theory of Computing, STOC 2011, San Jose, CA, USA, 6-8 June 2011. pages 489-498, ACM, 2011. [doi]

Abstract

Abstract is missing.