標(biāo)題: Titlebook: Algorithmic Number Theory; 8th International Sy Alfred J. Poorten,Andreas Stein Conference proceedings 2008 Springer-Verlag Berlin Heidelbe [打印本頁] 作者: CULT 時間: 2025-3-21 16:44
書目名稱Algorithmic Number Theory影響因子(影響力)
書目名稱Algorithmic Number Theory影響因子(影響力)學(xué)科排名
書目名稱Algorithmic Number Theory網(wǎng)絡(luò)公開度
書目名稱Algorithmic Number Theory網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Algorithmic Number Theory被引頻次
書目名稱Algorithmic Number Theory被引頻次學(xué)科排名
書目名稱Algorithmic Number Theory年度引用
書目名稱Algorithmic Number Theory年度引用學(xué)科排名
書目名稱Algorithmic Number Theory讀者反饋
書目名稱Algorithmic Number Theory讀者反饋學(xué)科排名
作者: Laconic 時間: 2025-3-21 22:01 作者: lipoatrophy 時間: 2025-3-22 03:35 作者: Climate 時間: 2025-3-22 07:13
Almost Prime Orders of CM Elliptic Curves Modulo ,cd. splits in ., where . is the size of the group of rational . points, and prove that it can be bigger than the common factor that comes from the torsion of the curve. Then, we prove that #{.?≤?., . splits in . hence extending the results in [16]. This is the best known result in the direction of t作者: 助記 時間: 2025-3-22 10:59
Efficiently Computable Distortion Maps for Supersingular Curves that there exists a distortion map in a specific set of efficiently computable endomorphisms for every pair of nontrivial divisors . for two types of curves. In this paper, we prove that this result holds using a different method . for both curves with .?>?5 and .?>?19 respectively, where . is the 作者: Mere僅僅 時間: 2025-3-22 16:34 作者: maladorit 時間: 2025-3-22 17:43 作者: 小官 時間: 2025-3-23 00:21
Some Improvements to 4-Descent on an Elliptic Curvef 4-descent in the search for generators of large height on elliptic curves of rank at least 2, we explain how to cut down the number of class group and unit group calculations required, by using the group law on the 4-Selmer group.作者: Strength 時間: 2025-3-23 01:56
Predicting the Sieving Effort for the Number Field Sieveng test as input and simulates relations according to this test. After removing singletons, we decide how many relations we need for the factorization according to the simulation and this gives a good estimate for the real sieving. Experiments show that our estimate is within 2 % of the real data.作者: Hot-Flash 時間: 2025-3-23 07:03
Improved Stage 2 to P ± 1 Factoring Algorithmsn lengths around 2. and stage?2 limit around 10. while attempting to factor 230-digit numbers on modern PC’s. We describe arithmetic algorithms on reciprocal polynomials. We present adjustments for the P+1 algorithm. We list some new findings.作者: 隱士 時間: 2025-3-23 13:18
Shimura Curve Computations Via K3 Surfaces of Néron–Severi Rank at Least 19in explicit equations for Shimura curves and natural maps between them; determine a Schwarzian equation on each curve (a.k.a. Picard-Fuchs equation, a linear second-order differential equation with a basis of solutions whose ratio inverts the quotient map from the upper half-plane to the curve); and作者: frivolous 時間: 2025-3-23 16:20 作者: nerve-sparing 時間: 2025-3-23 19:49
Functorial Properties of Stark Units in Multiquadratic Extensions from certain subfields of a top field are placed with respect to the top field and how these roots relate to the Stark unit in the top field. This type of question is of particular relevance to gaining a better understanding of the somewhat mysterious “abelian condition” in Stark’s Conjecture.作者: 懲罰 時間: 2025-3-24 02:07 作者: palette 時間: 2025-3-24 03:26 作者: 圍裙 時間: 2025-3-24 08:20
Running Time Predictions for Factoring Algorithmsprecise estimate of the stopping time. We conjecture that there is a “sharp threshold” for this stopping time, that is, with probability 1???.(1) one will first obtain a square product when (precisely) . integers have been selected. Herein we will give a heuristic to justify our belief in this sharp transition.作者: Rheumatologist 時間: 2025-3-24 14:07 作者: PHIL 時間: 2025-3-24 15:49 作者: Heretical 時間: 2025-3-24 22:54 作者: Mumble 時間: 2025-3-25 00:59
Conference proceedings 2008re organized in topical sections on elliptic curves cryptology and generalizations, arithmetic of elliptic curves, integer factorization, K3 surfaces, number fields, point counting, arithmetic of function fields, modular forms, cryptography, and number theory.作者: 下垂 時間: 2025-3-25 06:21 作者: paroxysm 時間: 2025-3-25 11:15
Gesch?ftsmodell/Unternehmenskonzept locate CM (complex multiplication) points on the curves. We identified some curves, maps, and Schwarzian equations using the maps’ ramification behavior; located some CM points as images of fixed points of involutions; and conjecturally computed others by numerically solving the Schwarzian equations.作者: LVAD360 時間: 2025-3-25 13:24 作者: 除草劑 時間: 2025-3-25 16:56 作者: Mucosa 時間: 2025-3-25 22:49
Management, Personal und Organisationis principal and if so exhibiting a generator of that ideal. In the difficult case of the discriminant . of this order being positive, we develop a Las Vegas algorithm for solving the principal ideal problem that executes in expected time bounded by ., whereas the complexity of Lagrange’s (unconditional) technique for solving this problem is ..作者: lactic 時間: 2025-3-26 00:33 作者: Homocystinuria 時間: 2025-3-26 06:25 作者: legacy 時間: 2025-3-26 10:20 作者: 美色花錢 時間: 2025-3-26 12:53
Abelian Varieties with Prescribed Embedding Degreemple abelian variety . over the field . of . elements that has an .-rational point of order . and embedding degree?. with respect to .. We then discuss how CM-methods over . can be used to explicitly construct ..作者: 騎師 時間: 2025-3-26 18:03 作者: Afflict 時間: 2025-3-26 22:14 作者: finite 時間: 2025-3-27 05:10 作者: 仔細(xì)檢查 時間: 2025-3-27 08:48 作者: BORE 時間: 2025-3-27 12:56 作者: 驚奇 時間: 2025-3-27 16:44 作者: 取之不竭 時間: 2025-3-27 20:42
Functorial Properties of Stark Units in Multiquadratic Extensions from certain subfields of a top field are placed with respect to the top field and how these roots relate to the Stark unit in the top field. This type of question is of particular relevance to gaining a better understanding of the somewhat mysterious “abelian condition” in Stark’s Conjecture.作者: GREEN 時間: 2025-3-28 01:18 作者: Lumbar-Stenosis 時間: 2025-3-28 04:21
Management, Personal und Organisation used to show that this process stops after selecting (1?+?.)..(.) integers .. with probability 1???.(1) (where the function ..(.) is given explicitly in (1) below. Schroeppel’s algorithm actually finds the square product, and this has subsequently been adopted, with relatively minor modifications, 作者: 合適 時間: 2025-3-28 06:55 作者: AROMA 時間: 2025-3-28 12:46 作者: Aviary 時間: 2025-3-28 17:54
Gesch?ftsmodell/Unternehmenskonzeptcd. splits in ., where . is the size of the group of rational . points, and prove that it can be bigger than the common factor that comes from the torsion of the curve. Then, we prove that #{.?≤?., . splits in . hence extending the results in [16]. This is the best known result in the direction of t作者: 使顯得不重要 時間: 2025-3-28 21:21 作者: 格言 時間: 2025-3-29 00:04 作者: 圓錐體 時間: 2025-3-29 05:32
Management, Personal und Organisationup of points of good reduction; this is known to be finite, cyclic if?. has multiplicative reduction, and of order at most?4 if?. has additive reduction. We show how to compute explicitly an isomorphism . or ..作者: SAGE 時間: 2025-3-29 09:31 作者: 知識 時間: 2025-3-29 13:53 作者: 狂怒 時間: 2025-3-29 15:48
Gesch?ftsmodell/Unternehmenskonzeptn lengths around 2. and stage?2 limit around 10. while attempting to factor 230-digit numbers on modern PC’s. We describe arithmetic algorithms on reciprocal polynomials. We present adjustments for the P+1 algorithm. We list some new findings.作者: Mendicant 時間: 2025-3-29 21:17
Gesch?ftsmodell/Unternehmenskonzeptin explicit equations for Shimura curves and natural maps between them; determine a Schwarzian equation on each curve (a.k.a. Picard-Fuchs equation, a linear second-order differential equation with a basis of solutions whose ratio inverts the quotient map from the upper half-plane to the curve); and作者: Obliterate 時間: 2025-3-30 03:00 作者: 談判 時間: 2025-3-30 07:42 作者: Indent 時間: 2025-3-30 10:28
Management, Personal und Organisation order of discriminant?.?
作者: 陶瓷 時間: 2025-3-30 12:25
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/a/image/152999.jpg作者: conflate 時間: 2025-3-30 16:50
https://doi.org/10.1007/978-3-540-79456-1Prime; algebraic geometry; algebraic number fields; algebraic number theory; algorithm; algorithmic numbe作者: 過于光澤 時間: 2025-3-30 21:01 作者: 搏斗 時間: 2025-3-31 03:18
Algorithmic Number Theory978-3-540-79456-1Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: Obsessed 時間: 2025-3-31 05:25
Das Leistungs- und Produktportfoliomple abelian variety . over the field . of . elements that has an .-rational point of order . and embedding degree?. with respect to .. We then discuss how CM-methods over . can be used to explicitly construct ..作者: 受辱 時間: 2025-3-31 09:42 作者: Conflict 時間: 2025-3-31 13:43
Management, Personal und Organisationy be obtained. We give an explicit algorithm to generate such curves. We derive a heuristic lower bound for the number .(.) of MNT curves with .?=?6 and discriminant .?≤?., and compare this lower bound with experimental data.作者: 茁壯成長 時間: 2025-3-31 19:08
Management, Personal und Organisationup of points of good reduction; this is known to be finite, cyclic if?. has multiplicative reduction, and of order at most?4 if?. has additive reduction. We show how to compute explicitly an isomorphism . or ..
