2013 IEEE 54th Annual Symposium on Foundations of Computer Science (1996)
Oct. 14, 1996 to Oct. 16, 1996
M.O. Rabin , Hebrew Univ., Jerusalem, Israel
In this paper we present a simple geometric-like series of elements in a finite field F/sub q/, 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 F/sub p/, where p is a small prime. Hence the latter problem is also NP-hard. In the lecture we shall also survey other computationally hard algebraic problems.
computational complexity; computationally hard algebraic problems; geometric-like series; finite field; NP-hard; zeroes; linear recurrence sequence
M.O. Rabin, "Computationally hard algebraic problems", 2013 IEEE 54th Annual Symposium on Foundations of Computer Science, vol. 00, no. , pp. 284, 1996, doi:10.1109/SFCS.1996.548487