描述
发表于 2025-3-25 06:04:42
http://reply.papertrans.cn/16/1531/153001/153001_21.png
较早
发表于 2025-3-25 09:21:11
http://reply.papertrans.cn/16/1531/153001/153001_22.png
的阐明
发表于 2025-3-25 13:32:24
http://reply.papertrans.cn/16/1531/153001/153001_23.png
APO
发表于 2025-3-25 19:19:42
http://reply.papertrans.cn/16/1531/153001/153001_24.png
tariff
发表于 2025-3-25 20:55:12
http://reply.papertrans.cn/16/1531/153001/153001_25.png
photophobia
发表于 2025-3-26 02:04:43
Curves over Finite Fields with Many Rational Points Obtained by Ray Class Field Extensionsegrees of these extensions, which turns out to be the main difficulty. While in two special situations explicit formulas for the degrees are known, the general problem is solved algorithmically. The systematic application of the methods described yields several new examples of algebraic curves over
Rct393
发表于 2025-3-26 05:14:42
http://reply.papertrans.cn/16/1531/153001/153001_27.png
FACET
发表于 2025-3-26 09:45:20
Baby-Step Giant-Step Algorithms for Non-uniform Distributionsalisation of this algorithm, where extra baby steps may be computed after carrying out giant steps (thus increasing the giant step size). The paper considers the problem of deciding how many, and when, extra baby steps should be computed so that the expected cost of the generalised algorithm is mini
以烟熏消毒
发表于 2025-3-26 13:02:50
http://reply.papertrans.cn/16/1531/153001/153001_29.png
ARK
发表于 2025-3-26 17:42:30
Strategies in Filtering in the Number Field Sieve using a Block Lanczos algorithm. Both size and weight (the number of non-zero elements) of the matrix critically affect the running time of Block Lanczos. In order to keep size and weight small the relations coming out of the siever do not flow directly into the matrix, but are filtered first in or