Дискретная математика
Математика
  • формат pdf
  • размер 2.84 МБ
  • добавлен 28 декабря 2010 г.
Steinbach B., Posthoff C. Logic Functions and Equations: Examples and Exercises
Springer, 2009. - 234 Pages.

The field of binary Logics has two main areas of application, the Digital Design of Circuits (related to Electrical Engineering) and Propositional Logics (related to Mathematics, Artificial Intelligence, Complexity etc. ). In both cases it is quite possible to teach the theoretical foundations and to do some exercises, but in both cases the examples that can be done in class and by hand are far away from examples that are relevant for practical problems. Therefore a software package called XBOOLE Monitor will be made available (downloadable, without additional fees), and the exercises given in Logic Functions and Equations can be solved by using this software package - in this way it is possible to solve a lot of relevant problems and to study the solutions based on this software.
Похожие разделы
Смотрите также

Crama Y., Hammer P.L. Boolean Functions. Theory, Algorithms, and Applications

  • формат pdf
  • размер 4.54 МБ
  • добавлен 25 сентября 2011 г.
Издательство Cambridge University Press, 2011, -711 pp. Boolean functions, meaning {0,1}-valued functions of a finite number of {0,1}- valued variables, are among the most fundamental objects investigated in pure and applied mathematics. Their importance can be explained by several interacting factors. It is reasonable to argue that a multivariate function f :A1?A2?. . .?An? A is interesting only if each of the sets A1,A2, . . . ,An, and A cont...

Gallier J. Discrete Mathematics

  • формат pdf
  • размер 4.03 МБ
  • добавлен 17 февраля 2011 г.
Springer, 2011. - 465 pages. This books gives an introduction to discrete mathematics for beginning undergraduates. One of original features of this book is that it begins with a presentation of the rules of logic as used in mathematics. Many examples of formal and informal proofs are given. With this logical framework firmly in place, the book describes the major axioms of set theory and introduces the natural numbers. The rest of the book is m...

Goodaire E.G., Parmenter M.M. Discrete Mathematics with Graph Theory

  • формат pdf
  • размер 27.12 МБ
  • добавлен 01 января 2011 г.
2nd ed. Prentice Hall, 2001. - 538 pages. Adopting a user-friendly, conversational — and at times humorous — style, these authors make the principles and practices of discrete mathematics as stimulating as possible while presenting comprehensive, rigorous coverage. Examples and exercises integrated throughout each chapter serve to pique reader interest and bring clarity to even the most complex concepts. Above all, the book is designed to engage...

Goodaire E.G., Parmenter M.M. Discrete Mathematics with Graph theory

  • формат pdf
  • размер 12.04 МБ
  • добавлен 30 января 2010 г.
Дискретная математика на английском языке. Состоит из 14 глав. Там есть большое количество заданий и к ним собственно ответы 0-Yes, There are Proofs! , 1-Logic, 2-Set and Relations, 3-functions, 4-The Integers, 5-Induction and Recursion, 6-Principles of Counting, 7-Permutations and Combinations, 8-Algoritms, 9-Graphs, 10-Path and Circuits, 11-Applications of Paths and Circuits, 12-Trees, 13-Planar Graphs Colorings, 14-The Max Flow-Min Cut Theorem...

Hein J.L. Discrete Mathematics

  • формат pdf
  • размер 27.08 МБ
  • добавлен 01 января 2011 г.
2nd ed. Jones & Bartlett Publishers, 2002. - 731 pages. This introduction to discrete mathematics prepares future computer scientists, engineers, and mathematicians for success by providing extensive and concentrated coverage of logic, functions, algorithmic analysis, and algebraic structures. Discrete Mathematics, Second Edition illustrates the relationships between key concepts through its thematic organization and provides a seamless tran...

Kisacanin B. Mathematical Problems and Proofs: Combinatorics, Number Theory, and Geometry

  • формат djvu
  • размер 1.31 МБ
  • добавлен 31 января 2012 г.
Kluwer Academic Publishers, 2002. - 220 pages. Key to Symbols. Set Theory. Sets and Elementary Set Operations. Cartesian Product and Relations. Functions and Operations. Cardinality. Problems. Combinatorics. Four Enumeration Principles. Introductory Problems. Basic Definitions. Generating Functions. Problems. Number Theory. Divisibility of Numbers. Important Functions in Number Theory. Congruences. Diophantine Equations. Problems. Geometry. Prope...

Krantz S. Discrete Mathematics Demystified: A Self-Teaching Guide

  • формат pdf
  • размер 4.51 МБ
  • добавлен 10 апреля 2011 г.
McGraw-Hill, 2008. - 364 pages. If you're interested in learning the fundamentals of discrete mathematics but can't seem to get your brain to function, then here's your solution. Add this easy-to-follow guide to the equation and calculate how quickly you learn the essential concepts. Written by award-winning math professor Steven Krantz, Discrete Mathematics Demystified explains this challenging topic in an effective and enlightening way. You...

Mattson H.F. Discrete Mathematics with Applications

  • формат djvu
  • размер 5.72 МБ
  • добавлен 21 марта 2011 г.
John Wiley & Sons, 1993. - 538 pages. Applauded by reviewers for its inviting, conversational style and outstanding coverage of logic and inductions, it introduces students to the topics and language of discrete mathematics and prepares them for future work in mathematics and/or computer science. Mattson develops students' mathematical thinking and overall maturity through careful presentation and development of proofs, numerous detailed exa...

O’Donnell J., Hall C., Page R. Discrete Mathematics Using a Computer

  • формат pdf
  • размер 1.97 МБ
  • добавлен 28 октября 2011 г.
Издательство Springer, 2006, -445 pp. Computer science abounds with applications of discrete mathematics, yet students of computer science often study discrete mathematics in the context of purely mathematical applications. They have to figure out for themselves how to apply the ideas of discrete mathematics to computing problems. It is not easy. Most students fail to experience broad success in this enterprise, which is not surprising, since ma...

Stanley R.P. Enumerative Combinatorics. Volume 2

  • формат djvu
  • размер 5.23 МБ
  • добавлен 04 октября 2011 г.
Издательство Cambridge University Press, 1999, -595 pp. This is the second of a two-volume basic introduction to enumerative combinatorics at a level suitable for graduate students and research mathematicians. This volume covers the composition of generating functions, trees, algebraic generating functions, D-finite generating functions, noncommutative generating functions, and symmetric functions. The chapter on symmetric functions provides the...