8 search results - page 2 / 2 » The Complexity of Computing the Hilbert Polynomial of Smooth... |
AAECC
2010
Springer
13 years 5 months ago
2010
Springer
The aim of this paper is a comprehensive presentation of the geometrical tools which are necessary to prove the correctness of several up to date algorithms with intrinsic complex...
ASIACRYPT
2000
Springer
13 years 9 months ago
2000
Springer
Abstract. Construction of secure hyperelliptic curves is of most important yet most difficult problem in design of cryptosystems based on the discrete logarithm problems on hyperel...
DATE
2010
IEEE
13 years 10 months ago
2010
IEEE
—1 In this paper we present a stochastic model order reduction technique for interconnect extraction in the presence of process variabilities, i.e. variation-aware extraction. It...