Drmota M., Flajolet P., Gardy D., Gittenberger B. (editors) Mathematics and Computer Science III: Algorithms, Trees, Combinatirics and Probabilities

формат djvu
размер 5.34 МБ
добавлен 13 января 2011 г.

Birkh?user Basel, 2004. - 554 pages.

This book contains invited and contributed papers on combinatorics, random graphs and networks, algorithms analysis and trees, branching processes, constituting the Proceedings of the 3rd Inteational Colloquium on Mathematics and Computer Science that will be held in Vienna in September 2004. It addresses a large public in applied mathematics, discrete mathematics and computer science, including researchers, teachers, graduate students and engineers. They will find here current questions in Computer Science and the related mode and powerful mathematical methods.

Похожие разделы

Смотрите также

Albertson M.O., Hutchinson J.P. Discrete Mathematics with Algorithms

формат pdf
размер 5.85 МБ
добавлен 23 октября 2011 г.

Издательство John Wiley, 2002, -552 pp. Here is a first-year course in discrete mathematics, requiring no calculus or computer programming experience, for students on computer science and mathematics courses. The approach stresses finding efficient algorithms, rather than existential results. It provides an introduction to constructing proofs (especially by induction), and an introduction to algorithmic problem solving. All algorithms are presen...

Chikalov I. Average Time Complexity of Decision Trees

формат pdf
размер 975.04 КБ
добавлен 09 ноября 2011 г.

Издательство Springer, 2011, -114 pp. The monograph is devoted to theoretical and experimental study of decision trees with a focus on minimizing the average time complexity. The study resulted in upper and lower bounds on the minimum average time complexity of decision trees for identification problems. Previously known bounds from information theory are extended to the case of identification problem with an arbitrary set of attributes. Some ex...

Feil T., Krone J. Essential Discrete Math for Computer Science

формат pdf
размер 8.91 МБ
добавлен 19 января 2011 г.

Prentice Hall, 2002. - 216 Pages. This book introduces readers to the mathematics of computer science and prepares them for the math they will encounter in other college courses. It includes applications that are specific to computer science, helps learners to develop reasoning skills, and provides the fundamental mathematics necessary for computer scientists. Chapter topics include sets, functions and relations, Boolean algebra, natural numbers...

Golumbic M.C., Hartman I.B.-A. Graph Theory, Combinatorics and Algorithms: Interdisciplinary Applications

формат pdf
размер 10.29 МБ
добавлен 12 декабря 2010 г.

Sprіnger, 2005. - 301 pages. Graph Theory, Combinatorics and Algorithms: Interdisciplinary Applications focuses on discrete mathematics and combinatorial algorithms interacting with real world problems in computer science, operations research, applied mathematics and engineering. The book contains eleven chapters written by experts in their respective fields, and covers a wide spectrum of high-interest problems across these discipline domains. A...

Haggard G., Schlipf J., Whitesides S. Discrete Mathematics for Computer Science

формат pdf
размер 25.96 МБ
добавлен 01 января 2011 г.

Brooks Cole, 2005. - 718 Pages. Master the fundamentals of discrete mathematics with DISCRETE MATHEMATICS FOR COMPUTER SCIENCE! An increasing number of computer scientists from diverse areas are using discrete mathematical structures to explain concepts and problems and this mathematics text shows you how to express precise ideas in clear mathematical language. Through a wealth of exercises and examples, you will learn how mastering discrete mat...

Rosen K.H., Michaels J.G. et al. Handbook of Discrete and Combinatorial Mathematics

формат djvu
размер 8.11 МБ
добавлен 31 января 2012 г.

Crc press, 2000. - 1183 pages. The Handbook of Discrete and Combinatorial Mathematics is the first book presenting a comprehensive collection of reference material for the essential areas of discrete mathematics as well as for important applications to computer science and engineering. Topics include logic and foundations, counting, number theory, abstract and linear algebra, probability, graph theory, networks and optimization, cryptography and...

Scheinerman E.A. Mathematics: A Discrete Introduction

формат pdf
размер 21.56 МБ
добавлен 11 августа 2011 г.

Brooks Cole, 2005. - 592 pages. This book has two primary objectives: It teaches students fundamental concepts in discrete mathematics (from counting to basic cryptography to graph theory), and it teaches students proof-writing skills. With a wealth of learning aids and a clear presentation, the book teaches students not only how to write proofs, but how to think clearly and present cases logically beyond this course. Overall, this book is an i...

Singh A. Elements of Computation Theory

формат pdf
размер 4.5 МБ
добавлен 08 декабря 2011 г.

Издательство Springer, 2009, -428 pp. The foundation of computer science is built upon the following questions: What is an algorithm? What can be computed and what cannot be computed? What does it mean for a function to be computable? How does computational power depend upon programming constructs? Which algorithms can be considered feasible? For more than 70 years, computer scientists are searching for answers to such questions. Their inge...

Voloshin V.I. Introduction to Graph Theory

формат pdf
размер 1.46 МБ
добавлен 14 ноября 2011 г.

Nova Science Publishers, 2009. - 144 pages. Graph Theory is an important area of contemporary mathematics with many applications in computer science, genetics, chemistry, engineering, industry, business and in social sciences. It is a young science invented and developing for solving challenging problems of 'computerised' society for which traditional areas of mathematics such as algebra or calculus are powerless. This book is for math and comp...