C++ Templates: The Complete Guide (2nd edition)

鼎鼎大名的 《C++ Template》第二版，20179月16日出版，全网首发。 Templates are among the most powerful features of C++, but they are too often neglected, misunderstood, and misused. C++ Templates: The Complete Guide provides software architects and engineers with a clear understanding of why, when, and how to use templates to build and maintain cleaner, faster, and smarter software more efficiently. C++ Templates begins with an insightful tutorial on basic concepts and language features. The remainder of the book serves as a comprehensive reference, focusing first on language details, then on a wide range of coding techniques, and finally on advanced applications for templates. Examples used throughout the book illustrate abstract concepts and demonstrate best practices. Readers learnThe exact behaviors of templatesHow to avoid the pitfalls associated with templatesIdioms and techniques, from the basic to the previously undocumentedHow to reuse source code without threatening performance or safetyHow to increase the efficiency of C++ programsHow to produce more flexible and maintainable software This practical guide shows programmers how to exploit the full power of the template features in C++. The companion Web site at http: //www.josuttis.com/tmplbook/ contains sample code and additional updates. 0201734842B09172002

C/C++函数手册(2013/08/08)

此离线包非本人制作，纯属转载备用。同时感谢原作者！

SMO Algorithm

SMO algorithm. Private.

Advanced Programming in the Unix Environment 3rd edition

Advanced Programming in the Unix Environment 3rd edition. 是最新版的第三版！请看仔细了。

The CPP Programming Language 4th Edition

The C++ Programming Language, 4th Edition 这是最新的第四版。

The Riemann Hypothesis

Contains recent advances and results in number theory Collects papers never before published in book form Explains the Riemann Hypothesis to someone without a background in complex analysis The Riemann Hypothesis has become the Holy Grail of mathematics in the century and a half since 1859 when Bernhard Riemann, one of the extraordinary mathematical talents of the 19th century, originally posed the problem. While the problem is notoriously difficult, and complicated even to state carefully, it can be loosely formulated as "the number of integers with an even number of prime factors is the same as the number of integers with an odd number of prime factors." The Hypothesis makes a very precise connection between two seemingly unrelated mathematical objects, namely prime numbers and the zeros of analytic functions. If solved, it would give us profound insight into number theory and, in particular, the nature of prime numbers. This book is an introduction to the theory surrounding the Riemann Hypothesis. Part I serves as a compendium of known results and as a primer for the material presented in the 20 original papers contained in Part II. The original papers place the material into historical context and illustrate the motivations for research on and around the Riemann Hypothesis. Several of these papers focus on computation of the zeta function, while others give proofs of the Prime Number Theorem, since the Prime Number Theorem is so closely connected to the Riemann Hypothesis. The text is suitable for a graduate course or seminar or simply as a reference for anyone interested in this extraordinary conjecture. Content Level » Professional/practitioner Related subjects » History of Mathematical Sciences - Number Theory and Discrete Mathematics

Primality Testing in Polynomial Time

Primality Testing in Polynomial Time: From Randomized Algorithms to "PRIMES Is in P"

Handbook of Elliptic and Hyperelliptic Curve Cryptography

Handbook of Elliptic and Hyperelliptic Curve Cryptography

Limits to Parallel Computation

This book is an introduction to the rapidly growing theory of P completeness — the branch of complexity theory that focuses on identifying the “hardest” problems in the class P of problems solvable in polynomial time. P -complete problems are of interest because they all appear to lack highly parallel solutions. That is, algorithm designers have failed to find NC algorithms, feasible highly parallel solutions that take time polynomial in the logarithm of the problem size while using only a polynomial number of processors, for them. Consequently, the promise of parallel computation, namely that applying more processors to a problem can greatly speed its solution, appears to be broken by the entire class of P -complete problems. This state of affairs is succinctly expressed as the following question: Does P equal NC ?

Boolean.Functions.and.Computation.Models,.Clote,.Kranakis,.Springer,.2002

This textbook presents a survey of research on boolean functions, circuits, parallel computation models, function algebras, and proof systems. Its main aim is to elucidate the structure of "fast" parallel computation. The complexity of parallel computation is emphasized through a variety of techniques ranging from finite combinatorics, probability theory, and finite group theory to finite model theory and proof theory. Nonuniform computation models are studied in the form of boolean circuits, uniform ones in a variety of forms. Steps in the investigation of non-deterministic polynomial time are surveyed as is the complexity of various proof systems. The book will benefit advanced undergraduate and graduate students as well as researchers in the field of complexity theory. Content Level » Research Keywords » Beweissysteme - Boolesche Funktionen - Komplexitätstheorie - Paralleles Rechnen Related subjects » Mathematics - Software Engineering - Theoretical Computer Science