American Mathematical Society

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

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

[61] Theodoulos Garefalakis and Daniel Panario. The index calculus method using non-smooth polynomials. Math. Comp. 70 (2001) 1253-1264. MR 1826581.
Abstract, references, and article information   
View Article: PDF
This article is available free of charge

[62] Joel Hass and Jeffrey C. Lagarias. The number of Reidemeister moves needed for unknotting. J. Amer. Math. Soc. 14 (2001) 399-428. MR 1815217.
Abstract, references, and article information
View Article: PDF
This article is available free of charge

[63] S. D. Galbraith, S. M. Paulus and N. P. Smart. Arithmetic on superelliptic curves. Math. Comp. 71 (2002) 393-405. MR 1863009.
Abstract, references, and article information   
View Article: PDF
This article is available free of charge

[64] Igor A. Semaev. Special prime numbers and discrete logs in finite prime fields. Math. Comp. 71 (2002) 363-377. MR 1863007.
Abstract, references, and article information   
View Article: PDF
This article is available free of charge

[65] David H. Bailey and David J. Broadhurst. Parallel integer relation detection: Techniques and applications. Math. Comp. 70 (2001) 1719-1736. MR 1836930.
Abstract, references, and article information   
View Article: PDF
This article is available free of charge

[66] Daniel J. Bernstein. Enumerating solutions to $p(a)+q(b)=r(c)+s(d)$. Math. Comp. 70 (2001) 389-394. MR 1709145.
Abstract, references, and article information
View Article: PDF
This article is available free of charge

[67] Antoine Joux and Reynald Lercier. ``Chinese & Match'', an alternative to Atkin's ``Match and Sort'' method used in the SEA algorithm. Math. Comp. 70 (2001) 827-836. MR 1680891.
Abstract, references, and article information   
View Article: PDF
This article is available free of charge

[68] R. P. Brent, R. E. Crandall, K. Dilcher and C. Van Halewyn. Three new factors of Fermat numbers. Math. Comp. 69 (2000) 1297-1304. MR 1697645.
Abstract, references, and article information   
View Article: PDF
This article is available free of charge

[69] Andreas Stein and H. C. Williams. Explicit primality criteria for $(p-1)p^n-1$. Math. Comp. 69 (2000) 1721-1734. MR 1697651.
Abstract, references, and article information   
View Article: PDF
This article is available free of charge

[70] Edlyn Teske. On random walks for Pollard's rho method. Math. Comp. 70 (2001) 809-825. MR 1697652.
Abstract, references, and article information   
View Article: PDF
This article is available free of charge

[71] Oliver Schirokauer. Using number fields to compute logarithms in finite fields. Math. Comp. 69 (2000) 1267-1283. MR 1653978.
Abstract, references, and article information   
View Article: PDF
This article is available free of charge

[72] 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

[73] 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

[74] 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

[75] 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

[76] 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

[77] 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

[78] 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

[79] Shuhong Gao. Elements of provable high orders in finite fields. Proc. Amer. Math. Soc. 127 (1999) 1615-1623. MR 1487368.
Abstract, references, and article information   
View Article: PDF
This article is available free of charge

[80] 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

[81] 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

[82] 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

[83] 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

[84] 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

[85] 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

[86] 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

[87] 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

[88] 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

[89] 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

[90] 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


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