Sciweavers

237 search results - page 10 / 48
» Algorithms for Exponentiation in Finite Fields
Sort
View
ISSAC
2009
Springer
163views Mathematics» more  ISSAC 2009»
14 years 2 months ago
Fast arithmetics in artin-schreier towers over finite fields
An Artin-Schreier tower over the finite field Fp is a tower of field extensions generated by polynomials of the form Xp − X − α. Following Cantor and Couveignes, we give a...
Luca De Feo, Éric Schost
KR
2000
Springer
13 years 11 months ago
Satisfiability Algorithms and Finite Quantification
This paper makes three observations with regard to the application of algorithms such as wsat and relsat to problems of practical interest. First, we identify a specific calculati...
Matthew L. Ginsberg, Andrew J. Parkes
MOC
2002
85views more  MOC 2002»
13 years 7 months ago
Hensel lifting and bivariate polynomial factorisation over finite fields
This paper presents an average time analysis of a Hensel lifting based factorisation algorithm for bivariate polynomials over finite fields. It is shown that the average running ti...
Shuhong Gao, Alan G. B. Lauder
JMLR
2010
135views more  JMLR 2010»
13 years 2 months ago
An Exponential Model for Infinite Rankings
This paper presents a statistical model for expressing preferences through rankings, when the number of alternatives (items to rank) is large. A human ranker will then typically r...
Marina Meila, Le Bao
ASIACRYPT
2000
Springer
13 years 12 months ago
Weil Descent of Elliptic Curves over Finite Fields of Characteristic Three
The paper shows that some of elliptic curves over finite fields of characteristic three of composite degree are attacked by a more effective algorithm than Pollard’s ρ method...
Seigo Arita