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

Brain-Imaging

Das Leistungs- und Produktportfoliomethod of Zagier in [2]; by using those ideas, together with techniques which have been used by the author to compute large tables of modular elliptic curves (see [1]), we are able to derive an explicit and general formula which is simpler to implement than Zagier‘s. We discuss the results obtained, including several examples.

expound

奴才

Enrage

Decomposition of algebraic functions,d in fact can be reformulated as a problem of .. We characterize all decompositions of a given algebraic function up to isomorphism, and give an exponential time algorithm for finding a nontrivial one if it exists. The algorithm involves genus calculations and constructing transcendental generators of fields of genus zero.

表示向下

不確定

遺棄

Infirm

Heegner point computations,iar setting. We then quote the key results and conjectures that we shall need concerning elliptic curves and Heegner points, and show how they yield practical algorithms for finding rational points on .. and other properties of such curves. We conclude with a report on more recent work along similar lines on the elliptic curves .. + .. = ..

corporate

Computing the degree of a modular parametrization,method of Zagier in [2]; by using those ideas, together with techniques which have been used by the author to compute large tables of modular elliptic curves (see [1]), we are able to derive an explicit and general formula which is simpler to implement than Zagier‘s. We discuss the results obtained, including several examples.

冥想后