zbMATH — the first resource for mathematics

Geometry Search for the term Geometry in any field. Queries are case-independent.
Funct* Wildcard queries are specified by * (e.g. functions, functorial, etc.). Otherwise the search is exact.
"Topological group" Phrases (multi-words) should be set in "straight quotation marks".
au: Bourbaki & ti: Algebra Search for author and title. The and-operator & is default and can be omitted.
Chebyshev | Tschebyscheff The or-operator | allows to search for Chebyshev or Tschebyscheff.
"Quasi* map*" py: 1989 The resulting documents have publication year 1989.
so: Eur* J* Mat* Soc* cc: 14 Search for publications in a particular source with a Mathematics Subject Classification code (cc) in 14.
"Partial diff* eq*" ! elliptic The not-operator ! eliminates all results containing the word elliptic.
dt: b & au: Hilbert The document type is set to books; alternatively: j for journal articles, a for book articles.
py: 2000-2015 cc: (94A | 11T) Number ranges are accepted. Terms can be grouped within (parentheses).
la: chinese Find documents in a given language. ISO 639-1 language codes can also be used.

a & b logic and
a | b logic or
!ab logic not
abc* right wildcard
"ab c" phrase
(ab c) parentheses
any anywhere an internal document identifier
au author, editor ai internal author identifier
ti title la language
so source ab review, abstract
py publication year rv reviewer
cc MSC code ut uncontrolled term
dt document type (j: journal article; b: book; a: book article)
Algorithmic number theory. Lattices, number fields, curves and cryptography. (English) Zbl 1154.11002
Mathematical Sciences Research Institute Publications 44. Cambridge: Cambridge University Press (ISBN 978-0-521-80854-5/hbk). x, 652 p. £ 50.00; $ 99.00 (2008).
The articles of this volume will be reviewed individually. Indexed articles: {\it Lenstra, Hendrik W.jun.}, Solving the Pell equation, 1-23 [Zbl 1178.11077] {\it Buhler, Joe; Wagon, Stan}, Basic algorithms in number theory, 25-68 [Zbl 1196.11170] {\it Pomerance, Carl}, Smooth numbers and the quadratic sieve, 69-81 [Zbl 1188.11065] {\it Stevenhagen, Peter}, The number field sieve, 83-100 [Zbl 1188.11066] {\it Schoof, René}, Four primality testing algorithms, 101-126 [Zbl 1196.11169] {\it Lenstra, Hendrik W.jun.}, Lattices, 127-181 [Zbl 1200.11046] {\it Poonen, Bjorn}, Elliptic curves, 183-207 [Zbl 1214.11073] {\it Stevenhagen, Peter}, The arithmetic of number rings, 209-266 [Zbl 1216.11099] {\it Granville, Andrew}, Smooth numbers: computational number theory and beyond, 267-323 [Zbl 1230.11157] {\it Bernstein, Daniel J.}, Fast multiplication and it applications, 325-384 [Zbl 1208.68239] {\it Pomerance, Carl}, Elementary thoughts on discrete logarithms, 385-396 [Zbl 1188.11070] {\it Schirokauer, Oliver}, The impact of the number field sieve on the discrete logarithm problem in finite fields, 397-420 [Zbl 1188.11071] {\it Bernstein, Daniel J.}, Reducing lattice bases to find small-height values of univariate polynomials, 421-446 [Zbl 1188.11068] {\it Schoof, René}, Computing Arakelov class groups, 447-495 [Zbl 1188.11076] {\it Cohen, Henri; Stevenhagen, Peter}, Computational class field theory, 497-534 [Zbl 1177.11095] {\it Bernstein, Daniel J.}, Protecting communications against forgery, 535-549 [Zbl 1157.94355] {\it Wan, Daqing}, Algorithmic theory of zeta functions over finite fields, 551-578 [Zbl 1188.11075] {\it Lauder, Alan G.B.; Wan, Daqing}, Counting points on varieties over finite fields of small characteristic, 579-612 [Zbl 1188.11069] {\it Top, Jaap; Yui, Noriko}, Congruent number problems and their variants, 613-639 [Zbl 1161.11014] {\it Stein, William A.}, An introduction to computing modular forms using modular symbols, 641-652 [Zbl 1188.11074]

11-06Proceedings of conferences (number theory)
14-06Proceedings of conferences (algebraic geometry)
00B15Collections of articles of miscellaneous specific interest
Full Text: Link