Sub-Linear Root Detection, and New Hardness Results, for Sparse Polynomials Over Finite Fields

Details Sub-Linear Root Detection, and New Hardness Results, for Sparse Polynomials Over Finite Fields Sub-Linear Root Detection, and New Hardness Results, for Sparse Polynomials Over Finite Fields

2012-04-05

arxiv.org/abs/1204.1113v2

Mathematics

Number Theory

15 pages total (cover page, 10 pages, references, and 3 short appendices). This version corrects various minor typos, and impr

Scientific paper

We present a deterministic 2^O(t)q^{(t-2)(t-1)+o(1)} algorithm to decide whether a univariate polynomial f, with exactly t monomial terms and degree

Affiliated with

Also associated with

No associations

Rating

Sub-Linear Root Detection, and New Hardness Results, for Sparse Polynomials Over Finite Fields does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Sub-Linear Root Detection, and New Hardness Results, for Sparse Polynomials Over Finite Fields, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Sub-Linear Root Detection, and New Hardness Results, for Sparse Polynomials Over Finite Fields will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-212213