Главная    Ex Libris    Книги    Журналы    Статьи    Серии    Каталог    Wanted    Загрузка    ХудЛит    Справка    Поиск по индексам    Поиск    Форум   
blank
Авторизация

       
blank
Поиск по указателям

blank
blank
blank
Красота
blank
Seymour L. — Schaum's Outline of Theory and Problems of Discrete Math
Seymour L. — Schaum's Outline of Theory and Problems of Discrete Math



Обсудите книгу на научном форуме



Нашли опечатку?
Выделите ее мышкой и нажмите Ctrl+Enter


Название: Schaum's Outline of Theory and Problems of Discrete Math

Автор: Seymour L.

Аннотация:

This Second Edition of Schaum`s Outline Series of Discrete Mathematics lets you focus on the problems that are at the heart of the subject. It cuts your study time by eliminating the extraneous material that clutters up so many textbooks. As you study at your own pace, this guide shows you step by step how to solve the kind of problems you`re going to find in your exams. It gives you hundreds of additional problems to let you test your skills, then check the answers yourself. And this new edition features all the latest applications of discrete mathematics to computer science! This guide can be used as a supplement, to reinforce and strengthen the work you do with your class text. (It works well with virtually any discrete mathematics textbook.) But it is so comprehensive that it can even be used alone as a text in discrete mathematics or as an independent study tool!


Язык: en

Рубрика: Математика/

Статус предметного указателя: Готов указатель с номерами страниц

ed2k: ed2k stats

Издание: 2nd Edition

Год издания: 2004

Количество страниц: 538

Добавлена в каталог: 15.11.2009

Операции: Положить на полку | Скопировать ссылку для форума | Скопировать ID
blank
Предметный указатель
Scalar, multiplication      105
Schroeder — Bernstein theorem      62 74
Search tree, binary      284
Search, binary      66
Search, breadth-first      247
Search, depth-first      247
Semigroup      367
Sequences      57
Sequences, Fibonacci      60
Sets      1—11
Sets, algebra of      7
Sets, countable      62
Sets, finite      9
Sets, indexed      57
Sets, ordered      442
Sets, product      27 444
Sets, quotient      36
Short-lex order      444
Shortest path      196
Shortest path, algorithm      244
Similar, binary trees      277
Similar, ordered sets      449
Similarity mapping      449
Simple, graph      191
Simple, path      193 239
Sink      234
Sort, topological      251
Source      234
Spanning tree      199
Special sequences      490
Square matrices      108—112
STACK      190
Standard deviation      160
Star graph      202
State      408 419
State, diagram      409 416
State, table      416
strings      58
Strongly connected      235
Subgroup      372
Subgroup, normal      373
Subsemigroup      368
Subset      2
Subset, proper      3
Substitution, principle of      83
Subtree      276
Subword      405
Succeeds      442
Success      158
Successor      233 444
Successor, list      233
Sum rule      133
Sum-of-products      481
Sum-of-products, complete      483
Summation symbol      58
Supremum (sup)      447
Surjective function      53
Syllogism, Law of      86
Symmetric, difference      7
Symmetric, group      371
Symmetric, matrix      121
Symmetric, relation      33
Synthetic division      63
Tables, truth      80 490
Tape (Turing machine)      417
Tape (Turing machine), expression      419
Tautology      82
Terminal in a grammar      411
Terminal node      276
Ternary relation      37
Totally ordered set      443
Trail      193
Trail, traversable      195
Transfinite induction      450
Transitive relation      33
Transitive relation, closure of      35
Transpose of a matrix      108
Traversable, multigraph      195
Traversable, trail      195
Traversal of binary trees      282
TREE      198
Tree, binary      276
Tree, derivation      414
Tree, diagram      38
Tree, general      294
Tree, ordered      237
Tree, rooted      236
Tree, spanning      199
Triangular form      113
Trivial graph      191
Truth, tables      80—82 490
Truth, values      78
Turing machine      413 431
Types of grammars      413
UFD (unique factorization domain)      379
Unilaterally connected      235
Union of sets      5
Unique factorization domain      379
Unit in a Boolean algebra      379
Unit in a ring      376
Unit, matrix In      108
Unity (identity) element in a ring      376
Universal, address system      237
Universal, quantifiers      88
Upper bound      453
Usual order      442
Utility graph      202
V(G)      190
Valid arguments      4
Variable      50
Variable in a grammar      412
Variable, random      159
Variance      161
Vectors      102—105
Venn diagram      3
Vertex      190 233
Vertex, file      246
Vertex, isolated      191
Warshall’s algorithm      242
Weakly connected      235
Weighted, graph      196
Weighted, path length      290
Welch — Powell algorithm      203
Well-ordered set      449
Well-ordered set, principle      318
Word      405
Word, empty      405
Worst case      64
Yes (accepting) states      408
Z (integers)      2 315
Zero, divisor      376
Zero, element      477
Zero, matrix      104
Zero, vector      103
1 2 3
blank
Реклама
blank
blank
HR
@Mail.ru
       © Электронная библиотека попечительского совета мехмата МГУ, 2004-2024
Электронная библиотека мехмата МГУ | Valid HTML 4.01! | Valid CSS! О проекте