American Mathematical Society

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

  
Results: 1 to 30 of 81 found      Go to page: 1 2 3

[1] Matthew Farrell and Lionel Levine. CoEulerian graphs. Proc. Amer. Math. Soc.
Abstract, references, and article information
View Article: PDF

[2] Ghaith A. Hiary. An alternative to Riemann-Siegel type formulas. Math. Comp. 85 (2016) 1017-1032.
Abstract, references, and article information   
View Article: PDF

[3] Jean Bourgain, Sergei V. Konyagin and Igor E. Shparlinski. Character sums and deterministic polynomial root finding in finite fields. Math. Comp. 84 (2015) 2969-2977.
Abstract, references, and article information   
View Article: PDF

[4] Richard P. Brent and Fredrik Johansson. A bound for the error term in the Brent-McMillan algorithm. Math. Comp. 84 (2015) 2351-2359.
Abstract, references, and article information   
View Article: PDF

[5] Cécile Gonçalves. A point counting algorithm for cyclic covers of the projective line. Contemporary Mathematics 637 (2015) 145-172.
Book volume table of contents   
View Article: PDF

[6] Ming-Deh Huang and Anand Kumar Narayanan. Computing class groups of function fields using stark units. Contemporary Mathematics 632 (2015) 193-214.
Book volume table of contents   
View Article: PDF

[7] Minkyu Kim and Jung Hee Cheon. Computing prime divisors in an interval. Math. Comp. 84 (2015) 339-354.
Abstract, references, and article information   
View Article: PDF

[8] Minkyu Kim, Jung Hee Cheon and In-Sok Lee. Analysis on a generalized algorithm for the strong discrete logarithm problem with auxiliary inputs. Math. Comp. 83 (2014) 1993-2004.
Abstract, references, and article information   
View Article: PDF

[9] W. M. Kantor and K. Magaard. Black box exceptional groups of Lie type. Trans. Amer. Math. Soc. 365 (2013) 4895-4931.
Abstract, references, and article information   
View Article: PDF

[10] Carlos Beltrán and Michael Shub. The complexity and geometry of numerically solving polynomial systems.. Contemporary Mathematics 604 (2013) 71-104.
Book volume table of contents   
View Article: PDF

[11] Alexei Myasnikov, Vladimir Shpilrain and Alexander Ushakov. Non-commutative Cryptography and Complexity of Group-theoretic Problems. Math. Surveys Monogr. 177 (2011) MR 2850384.
Book volume table of contents   

[12] Joel Berman, Paweł Idziak, Petar Markovic, Ralph McKenzie, Matthew Valeriote and Ross Willard. Varieties with few subalgebras of powers. Trans. Amer. Math. Soc. 362 (2010) 1445-1473. MR 2563736.
Abstract, references, and article information   
View Article: PDF
This article is available free of charge

[13] Antonio Cafure and Guillermo Matera. Fast computation of a rational point of a variety over a finite field. Math. Comp. 75 (2006) 2049-2085. MR 2240649.
Abstract, references, and article information   
View Article: PDF
This article is available free of charge

[14] Clément Mouhot and Lorenzo Pareschi. Fast algorithms for computing the Boltzmann collision operator. Math. Comp. 75 (2006) 1833-1852. MR 2240637.
Abstract, references, and article information
View Article: PDF
This article is available free of charge

[15] Yi Jin. On efficient computation and asymptotic sharpness of Kalantari's bounds for zeros of polynomials. Math. Comp. 75 (2006) 1905-1912. MR 2240641.
Abstract, references, and article information   
View Article: PDF
This article is available free of charge

[16] Scott Contini, Ernie Croot and Igor E. Shparlinski. Complexity of inverting the Euler function. Math. Comp. 75 (2006) 983-996. MR 2197003.
Abstract, references, and article information   
View Article: PDF
This article is available free of charge

[17] Bahman Kalantari. An infinite family of bounds on zeros of analytic functions and relationship to Smale's bound. Math. Comp. 74 (2005) 841-852. MR 2114651.
Abstract, references, and article information   
View Article: PDF
This article is available free of charge

[18] J. Dick and F. Y. Kuo. Reducing the construction cost of the component-by-component construction of good lattice rules. Math. Comp. 73 (2004) 1967-1988. MR 2059746.
Abstract, references, and article information   
View Article: PDF
This article is available free of charge

[19] Peter Mathé and Gang Wei. Quasi--Monte Carlo integration over $\mathbb{R}^d$. Math. Comp. 73 (2004) 827-841. MR 2031408.
Abstract, references, and article information   
View Article: PDF
This article is available free of charge

[20] Robert Beals, Charles R. Leedham-Green, Alice C. Niemeyer, Cheryl E. Praeger and Ákos Seress. A black-box group algorithm for recognizing finite symmetric and alternating groups, I. Trans. Amer. Math. Soc. 355 (2003) 2097-2113. MR 1953539.
Abstract, references, and article information   
View Article: PDF
This article is available free of charge

[21] Richard P. Brent, Samuli Larvala and Paul Zimmermann. A fast algorithm for testing reducibility of trinomials mod~2 and some new primitive trinomials of degree 3021377. Math. Comp. 72 (2003) 1443-1452. MR 1972745.
Abstract, references, and article information   
View Article: PDF
This article is available free of charge

[22] Richard E. Crandall, Ernst W. Mayer and Jason S. Papadopoulos. The twenty-fourth Fermat number is composite. Math. Comp. 72 (2003) 1555-1572. MR 1972753.
Abstract, references, and article information   
View Article: PDF
This article is available free of charge

[23] Xiaoqun Wang. Strong tractability of multivariate integration using quasi--Monte Carlo algorithms. Math. Comp. 72 (2003) 823-838. MR 1954970.
Abstract, references, and article information   
View Article: PDF
This article is available free of charge

[24] I. H. Sloan, F. Y. Kuo and S. Joe. On the step-by-step construction of quasi--Monte Carlo integration rules that achieve strong tractability error bounds in weighted Sobolev spaces. Math. Comp. 71 (2002) 1609-1640. MR 1933047.
Abstract, references, and article information   
View Article: PDF
This article is available free of charge

[25] Shuhong Gao and Alan G. B. Lauder. Hensel lifting and bivariate polynomial factorisation over finite fields. Math. Comp. 71 (2002) 1663-1676. MR 1933049.
Abstract, references, and article information   
View Article: PDF
This article is available free of charge

[26] Andreas Enge. Computing discrete logarithms in high-genus hyperelliptic Jacobians in provably subexponential time. Math. Comp. 71 (2002) 729-742. MR 1885624.
Abstract, references, and article information   
View Article: PDF
This article is available free of charge

[27] Andreas Enge and Andreas Stein. Smooth ideals in hyperelliptic function fields. Math. Comp. 71 (2002) 1219-1230. MR 1898752.
Abstract, references, and article information   
View Article: PDF
This article is available free of charge

[28] D. R. Stinson. Some baby-step giant-step algorithms for the low hamming weight discrete logarithm problem. Math. Comp. 71 (2002) 379-391. MR 1863008.
Abstract, references, and article information   
View Article: PDF
This article is available free of charge

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

[30] William M. Kantor and Ákos Seress. Black box classical groups. Memoirs of the AMS 149 (2001) MR 1804385.
Book volume table of contents   


Results: 1 to 30 of 81 found      Go to page: 1 2 3


Comments: Email Webmaster

© Copyright , American Mathematical Society
Contact Us · Sitemap · Privacy Statement

Connect with us Facebook Twitter Google+ LinkedIn Instagram RSS feeds Blogs YouTube Podcasts Wikipedia