Discrete mathematics for computer scientists
Key Features Thorough coverage of all area of discrete mathematics, including logic, natural numbers, coding theory, combinatorics, sets, algebraic functions, partially ordered structures, graphs, formal machines & complexity theory Special emphasis on the central role of propositional & pre...
Saved in:
| Main Author: | |
|---|---|
| Format: | Book |
| Published: |
Wokingham, England Reading, Mass.
Addison-Wesley
1992
©1991 |
| Series: | International computer science sereis
|
| Subjects: | |
| Online Access: | Click Here to View Status and Holdings. |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Add Tag | Summary: | Key Features Thorough coverage of all area of discrete mathematics, including logic, natural numbers, coding theory, combinatorics, sets, algebraic functions, partially ordered structures, graphs, formal machines & complexity theory Special emphasis on the central role of propositional & predicate logic Full chapters on algorithm analysis & complexity theory Introductory coverage of formal machines & coding theory Over 700 exercises Flexible structure so that the material can be easily adapted for different teaching styles. New to this Edition Improved treatment of induction Coverage of more 'basic' algebra List of symbols including page references for definition/explantion Modern text design and new exercises to aid student comprehension |
|---|---|
| Physical Description: | xviii, 565 pages illustrations 24 cm |
| Bibliography: | Includes bibliographical references (page 549-551) and index |
| ISBN: | 0201175649 |
Discrete mathematics for computer scientists