No label defined (Q4485830)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 1461246
Language Label Description Also known as
default for all languages
No label defined
    English
    No label defined
    scientific article; zbMATH DE number 1461246

      Statements

      19 June 2000
      0 references
      discrete mathematics
      0 references
      combinatorics
      0 references
      graph theory
      0 references
      coding theory
      0 references
      complexity theory
      0 references
      sets
      0 references
      partially ordered structures
      0 references
      logic
      0 references
      formal machines
      0 references
      relations
      0 references
      functions
      0 references
      algorithms
      0 references
      0 references
      The principal intended readership for this book are first- or second-year computer science undergraduates. Much of the material is appropriate for courses in discrete mathematics and theoretical computer science. Other topics have been included which come under the heading of mathematics suitable for a computer science readership, but which are pitched at a slightly higher level. The presentation is intended to be essentially self-contained: Due to the author, it should be in principle be possible for a reader with very little mathematical background to understand almost everything. Some mathematical maturity is nevertheless desirable, particularly when coping with the more advanced material in later chapters. Throughout the text, knowledge of basic high-school algebra is assumed, and some knowledge of programming concepts would be a help. To assist readers who are less familiar with the necessary background material, the author has included a short appendix of some basic algebra, polynomials, factorization, rational functions, and complex numbers, with some exercises. The style for algorithms and programs is mostly that of a PASCAL-like language. From the table of contents: 1. The natural numbers, 2. Introductory logic, 3. Sets, relations and functions, 4. Algebraic topics, 5. Combinatorics, 6. Partially ordered structures, 7. Further logic, 8. Graphs, 9. Formal machines, 10. Analysis of algorithms and complexity theory, 11. Coding theory. The first edition (Addison-Wesley 1991) has been annotated in Zbl 0753.00007.
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references