American Mathematical Society

My Account · My Cart · Customer Services · FAQ  
AMS eContent Search Results
Matches for: msc=(11Y16) AND publication=(mcom)
Sort order: Date
Format: Standard display

  
Results: 61 to 90 of 118 found      Go to page: 1 2 3 4

[61] Michael J. Jacobson Jr.. Applying sieving to the computation of quadratic class groups. Math. Comp. 68 (1999) 859-867. MR 1604324.
Abstract, references, and article information   
View Article: PDF
This article is available free of charge

[62] Peter Roelse. Factoring high-degree polynomials over $\mathbf F_2$ with Niederreiter's algorithm on the IBM SP2. Math. Comp. 68 (1999) 869-880. MR 1604383.
Abstract, references, and article information   
View Article: PDF
This article is available free of charge

[63] Gwoboa Horng and Ming-Deh Huang. Solving polynomials by radicals with roots of unity in minimum depth. Math. Comp. 68 (1999) 881-885. MR 1627793.
Abstract, references, and article information   
View Article: PDF
This article is available free of charge

[64] Volker Müller, Andreas Stein and Christoph Thiel. Computing discrete logarithms in real quadratic congruence function fields of large genus. Math. Comp. 68 (1999) 807-822. MR 1620235.
Abstract, references, and article information   
View Article: PDF
This article is available free of charge

[65] R. Lercier and F. Morain. Computing isogenies between elliptic curves over $F_{p^n}$ using Couveignes's algorithm. Math. Comp. 69 (2000) 351-370. MR 1642770.
Abstract, references, and article information   
View Article: PDF
This article is available free of charge

[66] James McKee. Speeding Fermat's factoring method. Math. Comp. 68 (1999) 1729-1737. MR 1653962.
Abstract, references, and article information   
View Article: PDF
This article is available free of charge

[67] J. E. Cremona and P. Serf. Computing the rank of elliptic curves over real quadratic number fields of class number 1 . Math. Comp. 68 (1999) 1187-1200. MR 1627777.
Abstract, references, and article information   
View Article: PDF
This article is available free of charge

[68] Helaman R. P. Ferguson, David H. Bailey and Steve Arno. Analysis of PSLQ, an integer relation finding algorithm. Math. Comp. 68 (1999) 351-369. MR 1489971.
Abstract, references, and article information   
View Article: PDF
This article is available free of charge

[69] Johannes Buchmann and Friedrich Eisenbrand. On factor refinement in number fields. Math. Comp. 68 (1999) 345-350. MR 1613766.
Abstract, references, and article information   
View Article: PDF
This article is available free of charge

[70] Richard P. Brent. Factorization of the tenth Fermat number. Math. Comp. 68 (1999) 429-451. MR 1489968.
Abstract, references, and article information   
View Article: PDF
This article is available free of charge

[71] Edlyn Teske. A space efficient algorithm for group structure computation. Math. Comp. 67 (1998) 1637-1663. MR 1474658.
Abstract, references, and article information   
View Article: PDF
This article is available free of charge

[72] Jeremy Teitelbaum. Euclid's algorithm and the Lanczos method over finite fields. Math. Comp. 67 (1998) 1665-1678. MR 1474657.
Abstract, references, and article information   
View Article: PDF
This article is available free of charge

[73] Igor A. Semaev. An algorithm for evaluation of discrete logarithms in some nonprime finite fields. Math. Comp. 67 (1998) 1679-1689. MR 1474656.
Abstract, references, and article information   
View Article: PDF
This article is available free of charge

[74] Daniel J. Bernstein. Detecting perfect powers in essentially linear time. Math. Comp. 67 (1998) 1253-1283. MR 1464141.
Abstract, references, and article information
View Article: PDF
This article is available free of charge

[75] L. Dewaghe. Remarks on the Schoof-Elkies-Atkin algorithm . Math. Comp. 67 (1998) 1247-1252. MR 1468941.
Abstract, references, and article information   
View Article: PDF
This article is available free of charge

[76] Shuhong Gao, Joachim von zur Gathen and Daniel Panario. Gauss periods: orders and cryptographical applications. Math. Comp. 67 (1998) 343-352. MR 1458221.
Abstract, references, and article information   
View Article: PDF
This article is available free of charge

[77] Johannes Buchmann, Michael J. Jacobson Jr. and Edlyn Teske. On some computational problems in finite abelian groups. Math. Comp. 66 (1997) 1663-1687. MR 1432126.
Abstract, references, and article information   
View Article: PDF
This article is available free of charge

[78] Simon Hunter and Jonathan Sorenson. Approximating the number of integers free of large prime factors. Math. Comp. 66 (1997) 1729-1741. MR 1423076.
Abstract, references, and article information   
View Article: PDF
This article is available free of charge

[79] Eric Bach. Comments on search procedures for primitive roots. Math. Comp. 66 (1997) 1719-1727. MR 1433261.
Abstract, references, and article information
View Article: PDF
This article is available free of charge

[80] David Bailey, Peter Borwein and Simon Plouffe. On the rapid computation of various polylogarithmic constants. Math. Comp. 66 (1997) 903-913. MR 1415794.
Abstract, references, and article information   
View Article: PDF
This article is available free of charge

[81] Johannes Buchmann and Victor Shoup. Constructing nonresidues in finite fields and the extended Riemann hypothesis. Math. Comp. 65 (1996) 1311-1326. MR 1348040.
Abstract, references, and article information   
View Article: PDF
This article is available free of charge

[82] Günter Löh and Wolfgang Niebuhr. A new algorithm for constructing large Carmichael numbers. Math. Comp. 65 (1996) 823-836. MR 1325872.
Abstract, references, and article information   
View Article: PDF
This article is available free of charge

[83] Harald Niederreiter and Rainer Göttfert. On a new factorization algorithm for polynomials over finite fields . Math. Comp. 64 (1995) 347-353. MR 1265019.
Abstract, references, and article information   
View Article: PDF
This article is available free of charge

[84] Shuhong Gao and Scott A. Vanstone. On orders of optimal normal basis generators . Math. Comp. 64 (1995) 1227-1233. MR 1297469.
Abstract, references, and article information   
View Article: PDF
This article is available free of charge

[85] Kenichi Iyanaga. A recursive method to calculate the number of solutions of quadratic equations over finite fields . Math. Comp. 64 (1995) 1319-1331. MR 1297472.
Abstract, references, and article information   
View Article: PDF
This article is available free of charge

[86] James McKee. Computing division polynomials . Math. Comp. 63 (1994) 767-771. MR 1248973.
Abstract, references, and article information   
View Article: PDF
This article is available free of charge

[87] Rainer Göttfert. An acceleration of the Niederreiter factorization algorithm in characteristic $2$ . Math. Comp. 62 (1994) 831-839. MR 1218344.
Abstract, references, and article information   
View Article: PDF
This article is available free of charge

[88] Harald Niederreiter. Factoring polynomials over finite fields using differential equations and normal bases . Math. Comp. 62 (1994) 819-830. MR 1216262.
Abstract, references, and article information   
View Article: PDF
This article is available free of charge

[89] Don Coppersmith. Solving homogeneous linear equations over ${\rm GF}(2)$ via block Wiedemann algorithm . Math. Comp. 62 (1994) 333-350. MR 1192970.
Abstract, references, and article information   
View Article: PDF
This article is available free of charge

[90] J.-M. Deshouillers and F. Dress. Numerical results for sums of five and seven biquadrates and consequences for sums of $19$ biquadrates . Math. Comp. 61 (1993) 195-207. MR 1201766.
Abstract, references, and article information   
View Article: PDF
This article is available free of charge


Results: 61 to 90 of 118 found      Go to page: 1 2 3 4