找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

Titlebook: Algorithmic Number Theory; First International Leonard M. Adleman,Ming-Deh Huang Conference proceedings 1994 Springer-Verlag Berlin Heidel

[复制链接]
查看: 11109|回复: 60
发表于 2025-3-21 20:01:29 | 显示全部楼层 |阅读模式
期刊全称Algorithmic Number Theory
期刊简称First International
影响因子2023Leonard M. Adleman,Ming-Deh Huang
视频video
学科分类Lecture Notes in Computer Science
图书封面Titlebook: Algorithmic Number Theory; First International  Leonard M. Adleman,Ming-Deh Huang Conference proceedings 1994 Springer-Verlag Berlin Heidel
影响因子This volume presents the refereed proceedings of the First Algorithmic Number Theory Symposium, ANTS-I, held at Cornell University, Ithaca, NY in May 1994..The 35 papers accepted for inclusion in this book address many current issues of algorithmic, computational and complexity-theoretic aspects of number theory and thus report the state-of-the-art in this exciting area of research; the book also contributes essentially to foundational research in cryptology and coding..Of particular value is a collection entitled "Open Problems in Number Theoretic Complexity, II" contributed by Len Adleman and Kevin McCurley. This survey presents on 32 pages 36 central open problems and relates them to the literature by means of some 160 references.
Pindex Conference proceedings 1994
The information of publication is updating

书目名称Algorithmic Number Theory影响因子(影响力)




书目名称Algorithmic Number Theory影响因子(影响力)学科排名




书目名称Algorithmic Number Theory网络公开度




书目名称Algorithmic Number Theory网络公开度学科排名




书目名称Algorithmic Number Theory被引频次




书目名称Algorithmic Number Theory被引频次学科排名




书目名称Algorithmic Number Theory年度引用




书目名称Algorithmic Number Theory年度引用学科排名




书目名称Algorithmic Number Theory读者反馈




书目名称Algorithmic Number Theory读者反馈学科排名




单选投票, 共有 0 人参与投票
 

0票 0%

Perfect with Aesthetics

 

0票 0%

Better Implies Difficulty

 

0票 0%

Good and Satisfactory

 

0票 0%

Adverse Performance

 

0票 0%

Disdainful Garbage

您所在的用户组没有投票权限
发表于 2025-3-21 21:29:05 | 显示全部楼层
发表于 2025-3-22 00:40:53 | 显示全部楼层
发表于 2025-3-22 07:22:44 | 显示全部楼层
Das Leistungs- und Produktportfoliohe base .. It is widely conjectured, but not proved, that . > 3 for infinitely many .. We show the stronger result that . > (log .). for infinitely many .. We also show that there are finite sets of odd composites which do not have a ., namely a common witness for all of the numbers in the set.
发表于 2025-3-22 11:48:21 | 显示全部楼层
Geschäftsmodell/Unternehmenskonzeptgorithm. Our experiments indicate that we have achieved a substantial speed-up compared to other implementations that are reported in the literature. The main improvements are a new lattice sieving technique and a trial division method that is based on lattice sieving in a hash table. This also allo
发表于 2025-3-22 15:42:29 | 显示全部楼层
https://doi.org/10.1007/978-3-8349-9232-1s do not appear to be easily adaptable for finding discrete logarithms in the groups associated with elliptic curves and the Jacobians of hyperelliptic curves. This has led to the development of cryptographic systems based on the discrete logarithm problem for such groups [12, 7, 8]. In this paper a
发表于 2025-3-22 18:36:29 | 显示全部楼层
发表于 2025-3-23 00:06:36 | 显示全部楼层
发表于 2025-3-23 02:31:17 | 显示全部楼层
发表于 2025-3-23 08:39:57 | 显示全部楼层
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 SITEMAP 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-5-21 13:08
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表