Abstract
In this paper we present a simple geometric-like series of elements in a finite field Fq, and show that computing its sum is NP-hard. This problem is then reduced to the problem of counting mod p the number of zeroes in a linear recurrence sequence with elements in a finite Fp, where p is a small prime. Hence the latter problem is also NP-harp. In the lecture we shall also survey other computationally hard algebraic problems.
| Original language | English |
|---|---|
| Pages (from-to) | 284-289 |
| Number of pages | 6 |
| Journal | Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS |
| State | Published - 1996 |
| Externally published | Yes |
| Event | Proceedings of the 1996 37th Annual Symposium on Foundations of Computer Science - Burlington, VT, USA Duration: 14 Oct 1996 → 16 Oct 1996 |