Paper Info
Title
Deterministic equation solving over finite fields
Abstract
Deterministic algorithms are presented for the efficient solution of diagonal homogeneous equations in many variables over finite fields. As auxiliary algorithms, it is shown how to compute a field generator that is an nth power, and how to write elements as sums of nth powers, for a given integer n. All these algorithms take polynomial time in n and in the logarithm of the field size, and are practical as stated.
Year
DOI
Venue
2005
10.1145/1073884.1073932
ISSAC
Keywords
Field
DocType
deterministic algorithm,diagonal homogeneous equation,auxiliary algorithm,efficient solution,finite field,integer n,field generator,polynomial time,field size,nth power,deterministic equation,finite fields,equation solving
Diagonal,Integer,Discrete mathematics,Equation solving,Finite field,Combinatorics,Deterministic finite automaton,Deterministic algorithm,Logarithm,Time complexity,Mathematics
Conference
ISBN
Citations 
PageRank 
1-59593-095-7
10
1.15
References 
Authors
11
1
Name
Order
Citations
PageRank
Christiaan Van De Woestijne1132.33