找回密碼
 To register

QQ登錄

只需一步,快速開始

掃一掃,訪問微社區(qū)

打印 上一主題 下一主題

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

[復(fù)制鏈接]
樓主: Consonant
11#
發(fā)表于 2025-3-23 11:33:19 | 只看該作者
Management Personal und Organisation in the “congruent number” problem. We begin by briefly reviewing the cyclotomic construction of units in real quadratic number fields, which is analogous in many ways to the Heegner-point approach to the arithmetic of elliptic curves, and allows us to introduce some of the key ideas in a more famil
12#
發(fā)表于 2025-3-23 16:09:51 | 只看該作者
Das Leistungs- und ProduktportfolioΓ.(.) of the modular group Γ = .(2, ?). Equivalently, there is a non-constant map ? from the modular curve ... to .. We present here a method of computing the degree of such a map ? for arbitrary .. Our method, which works for all subgroups of finite index in Γ and not just Γ.(.), is derived from a
13#
發(fā)表于 2025-3-23 20:41:50 | 只看該作者
Das Leistungs- und Produktportfoliowhen applied to random inputs, the complexity is asymptotically constant, the probability distribution decays geometrically, and the dynamics is characterized by a conditional invariant measure. The proofs make use of connections between lattice reduction, continued fractions, continuants, and funct
14#
發(fā)表于 2025-3-23 22:56:13 | 只看該作者
15#
發(fā)表于 2025-3-24 02:25:44 | 只看該作者
Management, Personal und OrganisationWe report on algorithmic aspects of the problem of explicitly computing the rate of growth of the field of ..-th division points on an .-dimensional simple Abelian variety with Complex Multiplication. Two new examples are discussed.
16#
發(fā)表于 2025-3-24 07:33:44 | 只看該作者
17#
發(fā)表于 2025-3-24 11:30:33 | 只看該作者
Leistungs- und ProduktportfolioWe show that if polynomials with many rational roots have polynomial length straight-line complexity, then integer factorization is “easy”.
18#
發(fā)表于 2025-3-24 15:32:15 | 只看該作者
19#
發(fā)表于 2025-3-24 20:53:42 | 只看該作者
Counting the number of points on elliptic curves over finite fields of characteristic greater than We present a variant of an algorithm of Oliver Atkin for counting the number of points on an elliptic curve over a finite field. We describe an implementation of this algorithm for prime fields. We report on the use of this implementation to count the number of points on a curve over .., where . is a 375-digit prime.
20#
發(fā)表于 2025-3-25 00:00:40 | 只看該作者
Straight-line complexity and integer factorization,We show that if polynomials with many rational roots have polynomial length straight-line complexity, then integer factorization is “easy”.
 關(guān)于派博傳思  派博傳思旗下網(wǎng)站  友情鏈接
派博傳思介紹 公司地理位置 論文服務(wù)流程 影響因子官網(wǎng) 吾愛論文網(wǎng) 大講堂 北京大學(xué) Oxford Uni. Harvard Uni.
發(fā)展歷史沿革 期刊點(diǎn)評(píng) 投稿經(jīng)驗(yàn)總結(jié) SCIENCEGARD IMPACTFACTOR 派博系數(shù) 清華大學(xué) Yale Uni. Stanford Uni.
QQ|Archiver|手機(jī)版|小黑屋| 派博傳思國際 ( 京公網(wǎng)安備110108008328) GMT+8, 2025-10-23 07:03
Copyright © 2001-2015 派博傳思   京公網(wǎng)安備110108008328 版權(quán)所有 All rights reserved
快速回復(fù) 返回頂部 返回列表
台安县| 改则县| 岳阳县| 辛集市| 开鲁县| 讷河市| 禄丰县| 乌拉特中旗| 凤庆县| 宁都县| 扶绥县| 巴塘县| 乐至县| 新建县| 涞源县| 军事| 大兴区| 射阳县| 随州市| 泗洪县| 曲靖市| 屏东县| 庆元县| 南京市| 东乌珠穆沁旗| 恩平市| 滨海县| 青神县| 女性| 怀远县| 桦川县| 河曲县| 自贡市| 延津县| 玛纳斯县| 泾阳县| 蒲江县| 黑河市| 儋州市| 卓尼县| 娄烦县|