Sciweavers

65 search results - page 1 / 13
» Fixed Points for Discrete Logarithms
Sort
View
314
Voted
ANTS
2010
Springer
291views Algorithms» more  ANTS 2010»
15 years 3 months ago
Fixed Points for Discrete Logarithms
: We establish a conjecture of Brizolis that for every prime p > 3 there is a primitive root r and an integer t in the interval [1, p − 1] with logr t = t. Here, logr is the d...
Mariana Levin, Carl Pomerance, K. Soundararajan
COMPGEOM
2008
ACM
15 years 1 months ago
External memory planar point location with logarithmic updates
Lars Arge, Gerth Stølting Brodal, S. Sriniv...
73
Voted
STOC
2005
ACM
151views Algorithms» more  STOC 2005»
15 years 12 months ago
On algorithms for discrete and approximate brouwer fixed points
Xi Chen, Xiaotie Deng
IIWAS
2004
15 years 1 months ago
An Efficient Group Signature Based on the Discrete Logarithm Problem
Group signature schemes permit a group member signing on messages anonymously and unlinkably on behalf of a group. The anonymity can be revoked when arguments occurred. This paper...
Fuw-Yi Yang, Jinn-ke Jan
CORR
2008
Springer
115views Education» more  CORR 2008»
14 years 11 months ago
Positive circuits and maximal number of fixed points in discrete dynamical systems
We consider a product X of n finite intervals of integers, a map F from X to itself, the asynchronous state transition graph (F) on X that Thomas proposed as a model for the dynam...
Adrien Richard