26 search results - page 1 / 6 » Descent for Discrete (Co)fibrations |
ACS
2004
13 years 10 months ago
2004
: We characterize the (effective) E-descent morphisms in the category Cat of small categories, when E is the class of discrete fibrations or the one of discrete cofibrations, and p...
JSCIC
2007
13 years 10 months ago
2007
In this paper, we examine some computational issues on finite element discretization of the p-Laplacian. We introduced a class of descent methods with multi-grid finite element ...
INDOCRYPT
2001
Springer
14 years 3 months ago
2001
Springer
In this paper, the authors analyze the Gaudry–Hess–Smart (GHS) Weil descent attack on the elliptic curve discrete logarithm problem (ECDLP) for elliptic curves defined over c...
HYBRID
2010
Springer
14 years 5 months ago
2010
Springer
One of the oldest problems in the study of dynamical systems is the calculation of an optimal control. Though the determination of a numerical solution for the general nonconvex o...
ASIACRYPT
2000
Springer
14 years 3 months ago
2000
Springer
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...