| Êíèãà | Ñòðàíèöû äëÿ ïîèñêà |
| Êîðìåí Ò., Ëåéçåðñîí ×., Ðèâåñò Ð. — Àëãîðèòìû: ïîñòðîåíèå è àíàëèç | 753 |
| Kedlaya K.S., Poonen B., Vakil R. — The William Lowell Putnam Mathematical Competition 1985–2000: Problems, Solutions, and Commentary | 58, 202, 257 |
| Bump D. — Algebraic Geometry | 107 |
| Ito K. — Encyclopedic Dictionary of Mathematics. Vol. 2 | 297.G |
| Grimaldi R.P. — Discrete and combinatorial mathematics. An introduction | 728 |
| Dummit D.S., Foote R.M. — Abstract algebra | 246, 265ff, 313, 357, 768 |
| Lang S. — Algebra | 94 |
| Cohn H. — Advanced Number Theory | 11, 134 |
| Rockett A.M., Szusz P. — Continued Fractions | 51 |
| Apostol T.M. — Introduction to Analytic Number Theory | 117 |
| Kisacanin B. — Mathematical problems and proofs. Combinatorics, Number theory, and Geometry | 106 |
| Graham R.L., Knuth D.E., Patashnik O. — Concrete mathematics | 126, 146 |
| Brown W.C. — Matrices over communicative rings | 175 |
| Eisenbud D., Harris J. — The Geometry of Schemes | 60 |
| Bump D. — Algebraic Geometry and the Theory of Curves | 107 |
| Mishra B. — Algorithmic algebra | 223 |
| Eisenbud D. — Commutative algebra with a view toward algebraic geometry | 72, 80 |
| Silverman J.H. — The arithmetic of elliptic curves | 225 |
| Becker T., Weispfenning V. — Groebner bases and commutative algebra | 115 |
| Kreuzer M., Robbiano L. — Computational commutative algebra 1 | 39, 245 |
| Rosenberg J. — Algebraic K-Theory and Its Applications | 1.3.14, 1.4.22, 2.3.5, 4.3.19 |
| Konheim A.G. — Computer Security and Cryptography | 400—401 |
| Bachman G. — Introduction to p-Adic Numbers and Valuation Theory | 22, 136 |
| Newman M. — Integral Matrices | 8 |
| Bach E., Shallit J. — Algorithmic Number Theory (òîì 1) | 3, 101, 104—108, 118, 122, 289 |
| Artin M. — Algebra | 303, 441 |
| Dummit D.S., Foote R.M. — Abstract Algebra | 267ff, 270, 307 |
| Wegener I. — Complexity of Boolean Functions | 61 |
| Behnke H., Bachmann F., Fladt K. — Fundamentals of Mathematics, Volume I: Foundations of Mathematics: The Real Number System and Algebra | 391 |
| Straubing H. — Finite automata, format logic, and circuit complexity | 135 |
| Grillet P.A. — Abstract Algebra | 289 |
| Hazewinkel M. (ed.) — Handbook of Algebra, Volume 4 | 413 |
| Lorenz F., Levy S. — Algebra, Volume I: Fields and Galois Theory | 42, 88 |
| Le Bruyn L. — Noncommutative geometry | 87 |
| Ash R.B. — Abstract algebra: the basic graduate year | 2.3 |
| Lorenz M. — Multiplicative Invariant Theory | 83 |
| Kunz E. — Introduction to Plane Algebraic Curves | 218, 265 |
| Everest G., Ward T. — An Introduction to Number Theory | 61, 81, 256 |
| Bourbaki N. — Algebra II: Chapters 4-7 | VI, page 33, exercise 25 |
| Surowski D. — Workbook in higher algebra | 76 |
| Connell E.H. — Elements of abstract and linear algebra | 50, 108 |
| Ellis G. — Rings and Fields | 70, 81 |
| Lozansky E., Rousseau C. — Winning Solutions | 23—24 |
| Bauer F.L. — Decrypted Secrets: Methods and Maxims of Cryptology | 202, 208 |
| Kato K., Kurokawa N., Saito T. — Number Theory I. Fermat's Dream | 51 |
| Alaca S., Williams K.S. — Introductory Algebraic Number Theory | 213, 217 |
| Koblitz N. — A course in number theory and cryptography | 21 |
| Wicker S.B., Kim S. — Fundamentals of Codes, Graphs, and Iterative Decoding | 58 |
| Roggenkamp K.W., Huber-Dyson V. — Lattices Over Orders I | I 47 |
| Humphreys J.F., Prest M.Y. — Numbers, Groups and Codes | 54,67 |
| Sipser M. — Introduction to the theory of computation | 373 |
| Murty M.R., Esmonde J. — Problems in algebraic number theory | 60, 175 |
| Cohen H.A. — A Course in Computational Algebraic Number Theory | 19 |
| Jones J.A., Jones J.M. — Elementary Number Theory | 53, 59 |
| Cohn P.M. — Algebraic numbers and algebraic functions | 8 |
| Hein J.L. — Discrete Mathematics | 567 |
| Papadimitriou C.H. — Computational Complexity | 225, 237 |
| Dudgeon D.E., Mersereau R.M. — Multidimensional Digital Signal Processing | 103 |
| Knuth D.E. — The art of computer programming (vol. 2 Seminumerical Algorithms) | 285—290, 389, 404, 509, 584 |
| Motwani R., Raghavan P. — Randomized algorithms | 396, 408, 422, 423 |
| Neukrich J. — Algebraic number theory | 21 |
| Ito K. — Encyclopedic Dictionary of Mathematics | 297.G |
| Monk J.D. — Mathematical Logic | 57 |
| Tourlakis G.J. — Lectures in Logic and Set Theory: Mathematical Logic | 160 |
| Knuth D.E. — The art of computer programming (Vol. 2. Seminumerical algorithms) | 269—271, 373, 629 |
| Hein J.L. — Discrete Structures, Logic, and Computability | 561 |
| Koblitz N., Wu Y.-H., Menezes A.J. — Algebraic Aspects of Cryptography | 33 |
| Edwards H.M. — Fermat's Last Theorem: A Genetic Introduction to Algebraic Number Theory | 375 |
| Silvester J.R. — Introduction to Algebraic K-Theory | 22, 68 |
| Warshauer M.L. — The Witt Group of Degree K Maps and Asymmetric Inner Product Spaces | 222 |
| Herman J., Simsa J., Kucera R. — Equations and Inequalities: Elementary Problems and Theorems in Algebra and Number Theory | 211 |
| Silverman J.H. — Advanced Topics in the Arithmetic of Elliptic Curves | 103, 158 |
| Wen-Tsun W. — Mathematics Mechanization | c1s1. 1 |
| Li H., Gras G. — Class Field Theory: From Theory to Practice | 35, 94, 286, 456, 457 |
| D'Angelo J.P., West D.B. — Mathematical Thinking: Problem-Solving and Proofs | xi, 139, 145, 6, 154, 390 |
| Kozen D.C. — The Design And Analysis Of Algorithms | 148, 204, 207, 209 |
| Fuhrmann P.A. — A Polynomial Approach to Linear Algebra | 113 |
| Nagata M. — Field Theory | 28 |
| Young R.M. — Excursions in Calculus: An Interplay of the Continuous and the Discrete | 373—375 |
| Clemens C.H. — Scrapbook of Complex Curve Theory | 35 |
| Mac Lane S., Birkhoff G.D. — Algebra | 125 |
| Prestel A., Delzell C.N. — Positive Polynomials: From Hilbert's 17th Problem to Real Algebra (Springer Monographs in Mathematics) | 211 |
| Kaye R. — Models of Peano Arithmetic | 58, 65 |
| Behrens E.-A. — Ring Theory: Volume 44 in Pure and Applied Mathematics | 230 |
| Koblitz N., Menezes A.J. (Contributor), Wu Y.-H. (Contributor) — Algebraic Aspects of Cryptography | 33 |
| Lang S. — Introduction to Algebraic and Abelian Functions | 3 |
| Andrews G.E. — Number Theory | 66—71, 228 |
| Hungerford T.W. — Algebra | 131 |
| Moh T.T. — Algebra | 20, 208 |
| Kotz S. — Breakthroughs in Statistics (volume 3) | 204 |
| Kaplansky I. — Fields and rings | 108—9 |
| de Souza P.N., Silva J.-N. — Berkeley Problems in Mathematics | 486 |
| Beaumont R.A., Pierce R.S. — The Algebraic Foundations of Mathematics | 188 |
| Eisenbud D., Harris J. — The geometry of schemes (textbook draft) | 60 |
| Lang S. — Algebra | 94 |
| Cox D.A., Little J., O'Shea D. — Using Algebraic Geometry | 104 |
| Seymour L. — Schaum's Outline of Theory and Problems of Discrete Math | 332, 357 |
| Lang S. — Introduction to Algebraic and Abelian functions | 3 |
| Cohn P.M. — Algebraic Numbers and Algebraic Functions | 8 |
| Villareal R.H. — Monomial algebras | 10 |
| Hans Rademacher — Lectures on elementary number theory | 22 |
| Enderton H.B. — A Mathematical Introduction to Logic | 91, 279 |
| Rosenfeld A. — An introduction to algebraic structures | 144 |
| Brewer J.W., Bunce J.W., Vleck F.S. — Linear systems over commutative rings | 132 |
| Goldstein L.J. — Analytic Number Theory | 18 |
| B.M. Stewart — Theory of Numbers | 103 |
| IItaka S. — Algebraic Geometry: An Introduction to Birational Geometry of Algebraic Varieties | 26, 143 |
| van Lint J.H., Wilson R.M. — Course in Combinatorics | 260 |
| Everest G., van der Poorten A., Shparlinski I. — Recurrence sequences | 49, 139 |
| Dolev S. — Self-Stabilization | 154 |
| Weiss J. — Java Cryptography Extensions: Practical Guide for Programmers | 71 |
| Lenstra H.W. — Development of the Number Field Sieve | 64, 66, 97, 98, 119, 124 |
| Leeuwen J.V. — Handbook of Theoretical Computer Science: Algorithms and Complexity | 653 |
| Ore O. — Number theory and its history | 240, 246—248, 251, 264, 265, 294, 304 |
| Stinson D.R. — Cryptography: Theory and practice | 170 |
| Baker A. — A Concise Introduction to the Theory of Numbers | 18, 22, 39 |
| Moskowitz M.A. — Adventures in mathematics | 45 |
| Moh T.T. — Algebra | 20, 208 |
| Cofman J. — Numbers and shapes revisited: More problems for young mathematicians | 45, 47—8 |
| Leeuwen J. (ed.), Meyer A.R., Nivat M. — Algorithms and Complexity, Volume A | 653 |
| Neuenschwander D. — Probabilistic and Statistical Methods in Cryptology: An Introduction by Selected Topics | 21 |
| Humphreys J.E. — Arithmetics Groups | 18 |
| Villarreal R.H. — Monomial Algebras | 10 |
| Swinnerton-Dyer H.P.F. — A brief guide to algebraic number theory | 12 |
| Lipschutz S., Lipson M.L. — Schaum's outline of theory and problems of discrete mathematics | 332, 357 |
| Hartshorne R. — Algebraic Geometry | 138 |
| Hazewinkel M. — Handbook of Algebra (÷àñòü 1) | 338 |
| Niven I., Zuckerman H.S. — An Introduction to the Theory of Numbers | 31 |
| Grimaldi R.P., Rothman D.J. — Discrete and Combinatorial Mathematics: An Applied Introduction | 702—704, 707, 708 |
| Mignotte M., Stefanescu D. — Polynomials: An Algorithmic Approach | 54 |
| LeVeque W.J. — Elementary theory of numbers | 52 |
| Adler A., Coury J. — The Theory of Numbers. A Text and Source Book of Problems | 46 |
| Swinnerton-Dyer H. P. F., Swinnerton-Dyer P. — A brief guide to algebraic number threory | 12 |
| Childs L. — A concrete introduction to higher algebra | 112, 216, 291 |
| Mathiak K. — Valuations of Skew Fields and Projective Hjelmslev Spaces | 42 |
| Abhyankar S.S. — Lectures on Algebra Volume 1 | 365, 371, 622 |
| Stillwell J. — Mathematics and its history | 135 |
| Elliott Mendelson — Introduction to mathematical logic | 151 |
| Davis P., Hersh R. — The Mathematical Experience | 187 |
| Lions J-L., Dautray R. — Mathematical Analysis and Numerical Methods for Science and Technology: Volume 2: Functional and Variational Methods | 71 |
| Anderson F.W., Fuller K.R. — Rings and Categories of Modules | 103 |
| Clarke E.M., Grumberg O., Peled D.A. — Model checking | 206 |
| Coutinho S. — The mathematics of ciphers: number theory and RSA cryptography | 111—112, 114—117, 119, 172 |
| Scheinerman E.A. — Mathematics: A Discrete Introduction | 323, 377, 544 |
| Sipser M. — Introduction to the Theory of Computation | 339 |
| Burgisser P., Clausen M., Shokrollahi M.A. — Algebraic complexity theory | 61, 75, 98 |
| Horowitz E., Rajasekaran S., Sahui S. — Computer Algorithms | 438, 444 |
| Posamentier A.S. — The Fabulous Fibonacci Numbers | 24 |
| Young D.M., Gregory R.T. — A Survey of Numerical Mathematics, Volume 2 | 874—876 |
| Grimaldi R.P. — Student Solutions Manual for Discrete and Combinatorial Mathematics | 702—704, 707, 708 |
| D'Angelo J.P., West D.B. — Mathematical thinking: problem-solving and proofs | xi, 139, 145—146, 154, 390 |
| Larson L.C. — Problem Solving Through Problems | 3.2.8 |
| Eves H. — Mathematical Circles Adieu | 182 |
| Adler A., Cloury J.E. — Theory of Numbers: A Text and Source Book of Problems | 46 |
| Geddes K.O., Czapor S.R., Labahn G. — Algorithms for computer algebra | 120—121, 175, 348 |
|
|
Î ïðîåêòå