找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

Titlebook: Algorithmic Number Theory; 4th International Sy Wieb Bosma Conference proceedings 2000 Springer-Verlag Berlin Heidelberg 2000 Algorithmic N

[复制链接]
楼主: formation
发表于 2025-3-30 10:16:44 | 显示全部楼层
Wieb BosmaIncludes supplementary material:
发表于 2025-3-30 16:05:58 | 显示全部楼层
发表于 2025-3-30 19:14:23 | 显示全部楼层
发表于 2025-3-31 00:27:04 | 显示全部楼层
0302-9743 Overview: Includes supplementary material: 978-3-540-67695-9978-3-540-44994-2Series ISSN 0302-9743 Series E-ISSN 1611-3349
发表于 2025-3-31 04:06:03 | 显示全部楼层
Management, Personal und Organisationf intractability. We will discuss Ajtai’s worst-case/average-case connections for the shortest vector problem, similar results for the closest vector problem and short basis problem, NP-hardness and non-NP-hardness, transference theorems between primal and dual lattices, and application to secure cryptography.
发表于 2025-3-31 09:00:35 | 显示全部楼层
Management, Personal und Organisationegrees 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 . and . with comparatively many rational points.
发表于 2025-3-31 12:47:53 | 显示全部楼层
Management, Personal und Organisation lattice basis in practice. We analyze substantial experimental data and to our knowledge, we are the first to present a general heuristic for determining which variant of the reduction algorithm, for varied parameter choices, yields the most efficient reduction strategy for reducing a particular problem instance.
发表于 2025-3-31 16:36:38 | 显示全部楼层
Das Leistungs- und Produktportfoliocle for ..(ℤ); the special values are computed as periods of Ψ, and are expressed in terms of generalized Dedekind sums. We conclude with some numerical examples for cubic and quartic fields of small discriminant.
发表于 2025-3-31 20:58:07 | 显示全部楼层
Das Umsatzvolumen im Optionshandel, on numbers of . bits. This algorithm is based on a recent algorithm of Atkin and Bernstein [1], modified using ideas developed by Voronoï for analyzing the Dirichlet divisor problem [20]. We give timing results which show our algorithm has roughly the expected running time.
发表于 2025-3-31 23:12:18 | 显示全部楼层
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 SITEMAP 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-5-23 02:20
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表