By Topic

Computationally hard algebraic problems

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
M. O. Rabin ; Hebrew Univ., Jerusalem, Israel

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-hard. In the lecture we shall also survey other computationally hard algebraic problems

Published in:

Foundations of Computer Science, 1996. Proceedings., 37th Annual Symposium on

Date of Conference:

14-16 Oct 1996