√лавна€    Ex Libris     ниги    ∆урналы    —татьи    —ерии     аталог    Wanted    «агрузка    ’удЋит    —правка    ѕоиск по индексам    ѕоиск    ‘орум   
blank
јвторизаци€

       
blank
ѕоиск по указател€м

blank
blank
blank
 расота
blank
Mott J.L., Kandel A., Baker T.P. Ч Discrete Mathematics For Computer Scientists And Mathematicians
Mott J.L., Kandel A., Baker T.P. Ч Discrete Mathematics For Computer Scientists And Mathematicians

„итать книгу
бесплатно

—качать книгу с нашего сайта нельз€

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



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


Ќазвание: Discrete Mathematics For Computer Scientists And Mathematicians

јвторы: Mott J.L., Kandel A., Baker T.P.

язык: en

–убрика: ћатематика/

—татус предметного указател€: √отов указатель с номерами страниц

ed2k: ed2k stats

√од издани€: 1986

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

ƒобавлена в каталог: 14.04.2014

ќперации: ѕоложить на полку | —копировать ссылку дл€ форума | —копировать ID
blank
ѕредметный указатель
"An Investigation of the Laws of Thought"      577
"Analysis-synthesis" reasoning      24Ч26
"Degree spectrum" of a directed graph      334
"Dictionary" ordering of strings      373Ч375
"Don't care" conditions      609
"Double hashing" algorithms      357Ч358
"Extraordinary" sets      9
"Greedy" method for increasing flow      663
"hard" AND for fuzzy set operations      705
"Hub" vertex      457
"Ordinary" sets      9
"Probe" sequence      358
"Ring" pattern      607
"Smallest" Boolean algebra      588Ч589
"Soft" AND for fuzzy set operations      705
"Soft" expert systems (SES)      722Ч724
"Soft" expert systems (SES), ARIES      727Ч731
"Soft" expert systems (SES), EKB      725Ч727
"Soft" expert systems (SES), FRKB      724Ч727
"Soft" expert systems (SES), VKB      725Ч727
"The First Theorem of Graph Theory"      440Ч441
"The Sum of Degrees Theorem"      440Ч441
"Vicious circle" fallacy      29
$@$-transitive fuzzy binary relation      713
$\alpha$-balanced binary tree      514
$\epsilon$-reflexive general fuzzy relation      726
$\hat{g}$-transitive general fuzzy relation      726
$\kappa$-chromatic graph      56 559
$\kappa$-critical graph      561
$\kappa$-partite graph      467
$\kappa$-regular graph      439
$\kappa$-way B-tree      503Ч504
$\theta$-transitivity of a similarity relation      726
2's complement form      620Ч621
2-valued Boolean function      134Ч136
5-Color Theorem      569Ч571
Abbreviated truth table      38Ч39
Absolute complement of a set      4
Absorption laws      582Ч583
Abstract set theory      2 see
Absurdity      38
Ackerman's Function      326
Ada programming language      378 428
Addend bit      614
Adder, full-adder      614 615Ч621
Adder, half-adder      614Ч615
Addition rule of inference      49
Adjacency matrix      396Ч402 450
Adjacency matrix, multiplicity matrix      536Ч537
Adjacency matrix, Warshall's algorithm      407Ч412 539
Adjacent primes      76
Adjacent to edge      333
Adjacent vertices      439
AI      see "Artificial intelligence"
Algebra, boolean      see "Boolean algebras"
Algebra, switching      see Switching mechanisms"
Algorithms, "double hashing"      357Ч358
Algorithms, asymptotic performance of      405
Algorithms, BFS      482Ч485
Algorithms, binary search      415Ч418
Algorithms, bubble sort      297 423
Algorithms, complexity of      407
Algorithms, correctness of      404
Algorithms, deterministic      419
Algorithms, DFS      482 485
Algorithms, division      64
Algorithms, efficiency of      404Ч407
Algorithms, Euclidean      78 117
Algorithms, flow-augmenting path      676
Algorithms, greedy      486Ч487
Algorithms, greedy, for vertex coloring      567
Algorithms, inefficient      406
Algorithms, inorder traversal (LNR)      515 518
Algorithms, interchange sort      418Ч423
Algorithms, Kruskal's      486Ч489
Algorithms, labeling      674Ч675
Algorithms, Merge Sort      282Ч284 425Ч426
Algorithms, minimal spanning tree      494
Algorithms, nondeterministic      419
Algorithms, partial correctness of      404
Algorithms, polynomial-bounded      406
Algorithms, postorder traversal (LRN)      515 518
Algorithms, preorder traversal (NLR)      514 515 518
Algorithms, Prim's      494
Algorithms, run times of      347
Algorithms, Shell sort      419
Algorithms, successive minima      419
Algorithms, termination of      404
Algorithms, topological sort      428Ч432
Algorithms, tree traversal      514Ч515 518
Algorithms, vertex labeling      674Ч675
Algorithms, Warshall's      407Ч412 539
Algorithms, Welsh Ч Powell      565Ч566
Alphabet      373
Alternating geometric series      250Ч251
ALU      see "Arithmetic logic unit"
Ambiguity, fallacy of      28
Amphiboly, fallacy of      28
Ancestor of a vertex      482
AND Boolean operator      398Ч400
AND function      601 603
AND, "hard" and "soft"      705
AND-VERTEX      729Ч731
AND/OR graph      728Ч731
ANSI Standard Y 32.14, 1973 for logic symbols      601
Antecedent of an implication      35
Antisymmetry of a binary relation      339 340
Antisymmetry of a fuzzy binary relation      713
Antisymmetry of a set relation      11
Appel, K.      569
Approximate reasoning inference engine (ARIES)      727Ч731
Argument, basic elements of      19Ч20
Argument, diagonal      377Ч378
Argument, Kempe-chain      569Ч571
ARIES      see "Approximate reasoning inference engine"
Arithmetic logic unit (ALU)      see also "Boolean functions minimization "Switching
Arithmetic logic unit (ALU), arithmetic operations, table of      621
Arithmetic logic unit (ALU), carry look-ahead technique      627
Arithmetic logic unit (ALU), full-adder      614 615Ч621
Arithmetic logic unit (ALU), half-adder      614Ч615
Arithmetic logic unit (ALU), logic operations, table of      620
Arithmetic logic unit (ALU), micro-operations      619Ч621
Arithmetic logic unit (ALU), multiplexers      621Ч626
Arithmetic micro-operations in an ALU      619Ч621
Arithmetic series      110 115
Arrangement      see "Combinations" "Permutations"
Artificial intelligence (AI)      720 731 see "Soft
Aspects of discovery      21Ч22
Associative binary operation on a set      16
Associative property of sets      5
Asymmetry of a binary relation      339 340
Asymptotic performance of algorithms      405
Atom of a Boolean algebra      588
Attribute values in the FRKB      725Ч726
Augend bit      614
B-tree of order k      503Ч504
Backtracking      26Ч27
Backward chaining in expert systems      724
Backward edge      666
Backward labeling      675
Basis of induction      103 111
BCD      see "Binary coded decimal"
Begging the question      29Ч30
Beta probability density function      733
BFS      see "Breadth-first search"
Biconditional proposition      37
Big O notation      344Ч346
Big O notation and algorithm efficiency      404Ч407
Big O notation, performance of height balanced binary trees      511
Big O notation, performance of sorting algorithms      347
Binary coded decimal (BCD) representation      596
Binary de Bruijn sequences      539Ч541
Binary operation on a set      16
Binary relations      see also "Relations"
Binary relations, adjacency matrix      396Ч402
Binary relations, antisymmetry      339 340
Binary relations, asymmetry      339 340
Binary relations, Boolean matrix      396Ч402
Binary relations, Boolean operations on      398Ч400
Binary relations, composition      382Ч383
Binary relations, fuzzy      713
Binary relations, inner product      397Ч398
Binary relations, inverse      381Ч382
Binary relations, irreflexivity      339 340
Binary relations, reflexivity      339 340
Binary relations, set      10
Binary relations, symmetry      339 340
Binary relations, transitive (reflexive) closure      383
Binary relations, transitivity      339Ч340
binary search algorithm      415Ч418
Binary search tree      512Ч514
Binary trees, $\alpha$-balanced      514
Binary trees, binary search tree      512Ч514
Binary trees, complete      509Ч510
Binary trees, conventions for drawing      508
Binary trees, defined      507
Binary trees, height balanced      510Ч512
Binary trees, inorder traversal (LNR)      515 518
Binary trees, left child, edge, subtree      507
Binary trees, level-order index of vertex      509
Binary trees, parent      507
Binary trees, postorder traversal (LRN)      515 518
Binary trees, preorder traversal (NLR)      514 515 518
Binary trees, right child, edge, subtree      507
Binary trees, traversal algorithms      514Ч515 518
binomial      201
Binomial coefficients      see also "Multinomial coefficients"
Binomial coefficients, as combinations      189Ч190
Binomial coefficients, as factorials      191
Binomial coefficients, boundary conditions      194Ч195
Binomial coefficients, column summation      197Ч198
Binomial coefficients, diagonal summation      196
Binomial coefficients, identities, additional      204
Binomial coefficients, Newton's identity      191Ч192
Binomial coefficients, Pascal's identity      192Ч194
Binomial coefficients, Pascal's triangle      193Ч194
Binomial coefficients, row square summation      197
Binomial coefficients, row summation      196
Binomial coefficients, secondary conditions      194Ч195
Binomial coefficients, symmetry property      191
Binomial coefficients, table of      195
Binomial coefficients, Vandermonde's identity      204Ч205
Bipartite graph      457 547Ч548 see
Block diagrams of logic circuits      601Ч602
Boole, George      577
Boolean algebras, "smallest"      588Ч589
Boolean algebras, absorption laws      582Ч583
Boolean algebras, atom      588
Boolean algebras, axioms      578
Boolean algebras, canonical form of expressions      589Ч591
Boolean algebras, conjunctive normal form      591Ч592
Boolean algebras, dagger function      593
Boolean algebras, defined      578
Boolean algebras, DeMorgan's laws      584
Boolean algebras, direct sum      585Ч586
Boolean algebras, disjunctive normal form      591Ч592
Boolean algebras, expressions for      588Ч593
Boolean algebras, finite      588
Boolean algebras, free      590
Boolean algebras, functionally complete operations      592Ч593
Boolean algebras, homomorphism      585
Boolean algebras, idempotent laws      580Ч581
Boolean algebras, involution law      583
Boolean algebras, isomorphism      585
Boolean algebras, lattice as      578
Boolean algebras, literal      590
Boolean algebras, maxterm, minterm expressions      590Ч592
Boolean algebras, modular law      587
Boolean algebras, notation for      579
Boolean algebras, partial order on      580
Boolean algebras, principle of duality      580
Boolean algebras, product-of-sums form      591 612
Boolean algebras, sheffer stroke function      593
Boolean algebras, subalgebra      584
Boolean algebras, sum-of-products form      591 605
Boolean algebras, switching mechanisms      see "Boolean algebras" "Switching
Boolean algebras, theorems for      580Ч585
Boolean functions, 2-valued      134Ч136
Boolean functions, minimization of Karnaugh maps      607Ч609 610Ч611 see "Switching
Boolean functions, product-of-sums forms      612
Boolean functions, self-dual 2-valued      135
Boolean functions, sum-of-products forms      605
Boolean functions, Veitch diagrams      606
Boolean matrices      396Ч402
Boolean operators      398Ч400
Boolean subalgebra      584
Boolean sum of sets      5
Bound, glb, lower, lub, upper      364
Boundary conditions of a recurrence relation      268
Breadth-first search (BFS)      482Ч485
Bridge edge      472 541
Bubble sort algorithm      297 419 423
Buck, R.C.      110
Canonical form for Boolean expressions      589Ч591
Canonical representative of equivalence class      356
Cantor's paradox for sets      7
Cantor, Georg      1 377
Capacity constraint      638
Capacity function of a directed graph      633
Capacity of a cut      647Ч648
Capacity of an edge      633Ч634 647Ч648
Cardinality of a fuzzy set      714
carry bit      614
Carry look-ahead technique      627
Cartesian product of fuzzy sets      707
Cartesian product of sets      8 10 128
Catenation of strings      373
Cauchy probability density function      733
Cayley's formula      497
Cells of a set      178
Certainty factor      722 724
Chain      363
Chaining in expert systems      724
character strings      373Ч375
Characteristic function of a set      2
Characteristic function of a set in IHR solutions      310Ч319
Characteristic function of a set, defined      301
Characteristic function of a set, distinct roots      301Ч302
Characteristic function of a set, multiple roots      302Ч304
Characteristic roots, method of      300Ч304
Child of a vertex      482
Chromatic numbers for planar graphs      569Ч571
Chromatic numbers, 5-Color Theorem      569Ч571
Chromatic numbers, defined      558
Chromatic numbers, greedy algorithm for vertex coloring      567
Chromatic numbers, Kempe-chain argument      569Ч571
Chromatic numbers, rules for determining      560Ч563
Chromatic numbers, The Four-Color Problem      569Ч571
Chromatic numbers, The Scheduling Problem      558Ч560
Chromatic numbers, Welsh Ч Powell algorithm      565Ч566
Circuit rank of a graph      481
Circuits in graphs      388 442
Circuits, combinatorial      see "Switching mechanisms"
Circuits, Eulerian      537Ч539
Circuits, full-adder      614 615Ч621
Circuits, half-adder      614Ч615
Circuits, Hamiltonian cycle      543Ч551
Circuits, logic      see "Logic gates"
Circuits, Simple      388 442
Circuits, switching      see "Switching mechanisms"
1 2 3 4 5 6 7
blank
–еклама
blank
blank
HR
@Mail.ru
       © Ёлектронна€ библиотека попечительского совета мехмата ћ√”, 2004-2019
Ёлектронна€ библиотека мехмата ћ√” | Valid HTML 4.01! | Valid CSS! ќ проекте