Learn IT - Books tags theorem

Classic Problems of Probability

John Wiley & Sons, 2012

"Classic Problems of Probability" is the winner of the 2012 PROSE Award for Mathematics from The American Publishers Awards for Professional and Scholarly Excellence.

"A great book, one that I will certainly add to my personal library."
--Paul J. Nahin, Professor Emeritus of Electrical...

Graphs, Networks and Algorithms (Algorithms and Computation in Mathematics)

Springer, 2012

From the reviews of the previous editions

".... The book is a first class textbook and seems to be indispensable for everybody who has to teach combinatorial optimization. It is very helpful for students, teachers, and researchers in this area. The author finds a striking synthesis of nice and interesting...

Introduction to Algorithms, Second Edition

MIT Press, 2001

The book moves forward with more advanced algorithms that implement strategies for solving more complicated problems (including dynamic programming techniques, greedy algorithms, and amortized analysis). Algorithms for graphing problems (used in such real-world business problems as optimizing flight schedules or flow through pipelines) come next....

Differential Geometry: Bundles, Connections, Metrics and Curvature (Oxford Graduate Texts in Mathematics, Vol. 23)

Oxford University Press, 2011

Bundles, connections, metrics and curvature are the 'lingua franca' of modern differential geometry and theoretical physics. This book will supply a graduate student in mathematics or theoretical physics with the fundamentals of these objects.

Many of the tools used in differential topology are introduced and the...

Automated Reasoning: 4th International Joint Conference, IJCAR 2008, Sydney, NSW, Australia, August 12-15, 2008, Proceedings

Springer, 2008

This book constitutes the refereed proceedings of the 4th International Joint Conference on Automated Reasoning, IJCAR 2008, held in Sydney, Australia, in August 2008. The 26 revised full research papers and 13 revised system descriptions presented together with 4 invited papers and a summary of the CASC-J4 systems competition were carefully...

The History of Approximation Theory: From Euler to Bernstein

Birkhauser, 2005

The problem of approximating a given quantity is one of the oldest challenges faced by mathematicians. Its increasing importance in contemporary mathematics has created an entirely new area known as Approximation Theory. The modern theory was initially developed along two divergent schools of thought: the Eastern or Russian group, employing...

Advances in Applied Artificial Intelligence (Computational Intelligence and Its Applications)

Idea Group Publishing, 2006

Discussion on the nature of intelligence long pre-dated the development of the
electronic computer, but along with that development came a renewed burst of investigation
into what an artificial intelligence would be. There is still no consensus on how
to define artificial intelligence: Early definitions tended to discuss the type of...

Topics in Geometry, Coding Theory and Cryptography (Algebra and Applications)

Springer, 2006

The purpose of this reviewarticle is to serve as an introduction and at the same time, as an invitation to the theory of towers of function fields over finite fields. More specifically, we treat here the case of explicit towers; i.e., towers where the function fields are given by explicit equations. The asymptotic behaviour of the genus and of the...

Beyond Reason: Eight Great Problems That Reveal the Limits of Science

John Wiley & Sons, 2004

A mind-bending excursion to the limits of science and mathematics
Are some scientific problems insoluble? In Beyond Reason, internationally acclaimed math and science author A. K. Dewdney answers this question by examining eight insurmountable mathematical and scientific roadblocks that have stumped thinkers across the...

Proofs and Algorithms: An Introduction to Logic and Computability (Undergraduate Topics in Computer Science)

Springer, 2011

Logic is a branch of philosophy, mathematics and computer science. It studies the required methods to determine whether a statement is true, such as reasoning and computation.

Proofs and Algorithms: Introduction to Logic and Computability is an introduction to the fundamental concepts of contemporary logic - those of a...

Logic and Structure (Universitext)

Springer, 2012

Dirk van Dalen’s popular textbook Logic and Structure, now in its fifth edition, provides a comprehensive introduction to the basics of classical and intuitionistic logic, model theory and Gödel’s famous incompleteness theorem.

Propositional and predicate logic are presented in an easy-to-read style using...

Memory as a Programming Concept in C and C++

Cambridge University Press, 2003

The overwhelming majority of program bugs and computer crashes stem from problems of memory access, allocation, or deallocation. Such memory-related problems are also notoriously difficult to debug. Yet the role that memory plays in C and C++ programming is a subject often overlooked in courses and books because it requires specialized knowledge...

Result Page: 13 12 11 10 9 8 7 6 5 4