Кормен Т., Лейзерсон Ч., Ривест Р. — Алгоритмы: построение и анализ :: Электронная библиотека попечительского совета мехмата МГУ

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

Авторизация

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

Кормен Т., Лейзерсон Ч., Ривест Р. — Алгоритмы: построение и анализ

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

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

Название: Алгоритмы: построение и анализ

Авторы: Кормен Т., Лейзерсон Ч., Ривест Р.

Аннотация:

Книга представляет собой перевод учебника по курсу построения и анализа эффективных алгоритмов, написанного в Массачусетском технологическом институте; в ней разбираются важнейшие классы быстрых алгоритмов и приёмы их построения.
Изложение подробное и математически строгое. Книгу можно использовать в качестве учебника и справочника; она будет полезна как студентам, так и профессионалам в области computer science и программирования.

Язык:

Рубрика: Computer science/

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

ed2k: ed2k stats

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

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

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

Операции: Положить на полку | Скопировать ссылку для форума | Скопировать ID

Предметный указатель

      103
-distance      833
-расстояние      833
$\alpha$ -balanced trees      353
$\alpha$ -сбалансированное дерево      353
$\binom{n}k$       103
$\cap$       79
$\cup$       79
$\in$       78
$\log^* n$       44
$\mathbb{N}$       78 737
$\mathbb{R}$       78
$\mathbb{Z}$       78 737
$\neg$       604
$\odot$       684
$\omega$ -notation      39
$\omega$ -обозначение      39
$\ominus$       685
$\oplus$       604 684
$\oslash$       78
$\otimes$       610
$\overline 0$       684
$\overline 1$       684
$\rho$ -эвристика      773
$\subset$       78
$\subseteq$       78
$\Theta$ -notation      36
$\Theta$ -обозначение      36
$\varepsilon$ -плотный граф      533
$\varphi$ -функция Эйлера      748 756
$\varphi(n)$       748
$\vee$       604 685
$\wedge$       604 685
*-операция Клини      842
0-1 knapsack problem      318
2-3-4-heaps      392
2-3-4-tree      362
2-3-4-дерево      362
2-3-4-кучи      392
2-CNF-SAT      863
3-CNF      860
3-CNF-SAT      861
3-COLOR      877
3-conjunctive normal form      860
3-конъюнктивная нормальная форма      860
6-раскраска      660
Abelian group      746
Above      817
Absorption laws      80
Abstract problem      838
ACCEPT      842
Accepted in polynomial time      842
Accepted string      789
Accepting state      788
Access time      360
Accounting method      341
Ackermann's function      424
Activity-selection problem      313
Acyclic subgraph      335
Additive group modulo n      746
Additive inverse      685
Adjacency matrix      438
Adjacency-list representation      436
Adjacent vertex      89
Admissible edge      565
Admissible network      565
Aggregate method      338
Algorithm      18
Algorithm, correctness of      19
Algorithm, greedy      313
Algorithm, randomized      158
Allocate-Object      205
Alphabet      841
Amortized analysis      337
Amortized cost      33
Ancestor      95 432
Ancestor, proper      95
AND      603 685
Annihilator      527 685
Antisymmetric relation      84
Any-Segments-Intersect      819
Approx-Subset-Sum      895
Approx-TSP-Tour      885
Approx-Vertex-Cover      883
Approximation algorithm      880
Approximation error      707
Approximation scheme      881
Arbitrage      505
Arbitrary-CRCW      634
Argument      85 86
Arithmetic circuits      602
Arithmetic series      50
Arora, S.      898
Array multiplier      617
Articulation point      462
Associative      79 527 685 746
Asymptotic efficiency      36
Asymptotic notation      36
Asymptotically nonnegative function      36
Asymptotically tight bound      37
Attribute of an object      21
Augmenting path      544
Average-case running time      24
Axioms of probability      107
B-tree      362
B-Tree-Create      365
B-Tree-Insert      367
B-Tree-Insert-Nonfull      368
B-Tree-Search      365
B-Tree-Split-Child      366
Bachmann, P.      48
Back edge      451
Back substitution      691
Bad character heuristic      803
Balanced tree      254
Balls (шары)      127
Barrel shifter      622
Basic functions      707
Bayes’s theorem      110
Bellman — Ford algorithm      494
Bellman-Ford      494
Bernoulli trials      116
BFS      440
Biconnected component      462
Bijection      86
Bin-packing      898
Binary character code      320
Binary counter      342
Binary entropy      105
Binary gcd algorithm      777
Binary heap      138
Binary relation      83
Binary search      29
Binary search tree      236 237
Binary tree      96
Binomial coefficients      104
Binomial distribution      118
Binomial expansion      104
Binomial heap      379
Binomial tree      377 398
Binomial-Heap-Decrease-Key      390
Binomial-Heap-Delete      390
Binomial-Heap-Extract-Min      388
Binomial-Heap-Insert      388
Binomial-Heap-Minimum      382
Binomial-Heap-Umion      383
Binomial-Link      383
Bins      127
Bipartite graph      91
Birthday paradox      126

Bit operations      737
Bit vector      214
Bit-reversal permutation      352
Bit-reverse binary      730
Bit-Reverse-Copy      731
Bit-serial adder      623
BitBLT      668
Bitonic sequence      590
Bitonic sorter      592
Bitonic tour      310
Black-height      255
Block transfer of bits      668
Boolean combinational element      603
Boolean function      105
Boolean quasiring      685
Boole’s inequality      111
Bottleneck traveling-salesman problem      888
Bound asymptotically tight      37
Boundary      305
Bounding box      813
Boyer-Moore-Matcher      801
Breadth-first search      39
Breadth-first tree      444
Brent’s theorem      651
Bridge      462
Brown, M.R.      354
Bucket      175 176
Bucket-Sort      176
Build-Heap      143
Build-Heap’      149
Butterfly operation      728
Calling the subroutine      22
Canonical form      332
Capacity      536
Capacity constraint      536
Capacity of the cut      545
Capacity, residual      542
Cardinality      81
Carmichael number      767
Carry status      609
Carry-in bit      608
Carry-lookahead adder      612
Carry-lookahead addition      607 608
Carry-out bit      608
Carry-save adder      614
Carry-save addition      608
Cartesian product      81
Cartesian sum      721
Cascading-Cut      407
Catalan numbers      253 290
CEILING      41
Certain event      107
Certificate      846
Chained-Hash-Delete      217
Chained-Hash-Insert      217
Chained-Hash-Search      217
Chaining      16
Child      95
Child list      396
Chinese remainder theorem      753
Chirp transform      727
Chord      305
Ciphertext      760
Circuit      651 852
CIRCUIT-SAT      852
Circuit-satistiability problem      52
Circular list      198
CLIQUE      864
Clique problem      864
clock      624
Clocked circuit      623
Clocked memory element      623
Closed      527 684
Closed interval      278
Closed semiring      527
Closest pair      830
Closest-point heuristic      888
Closure      530 746 842
Co-NP      847
Code Huffmen      322
Codeword      320
Codomain of a function      85
Coefficient      42 714
Coefficient representation      716
Coin      108
Coin changing      334
Collision      216
Coloring of a graph      98 660 877
Column rank      675
Column vector      671
Combinational circuit      602 604 651
Combinational element      603
Combining-CRCW      634
Common ancestor      432
Common divisor      739
Common subexpression      728
Common subsequence      300
Common subsequence, longest      301
Common-CRCW      634
Commutative      79 527 685 687
Compact-List-Search      211
Comparable segments      817
Comparator      584
Comparison network      585
Comparison sort      168
Compatible activities      313
Complement      80 842 867
Complete graph      91
Complete k-ary tree      97
Complete language      857
Complexity class      843
Complexity class NP      847
Complexity class P      840
Complexity measure      843
Component graph      461
Composite      738
Computational geometry      810
Computational problem      18 19
Compute-Good-Suffix-Function      806
Compute-Last-Occurence-Function      803
Compute-Prefix-Function      796
Compute-Summaries      532
Compute-Transition-Function      793
Concatenation      529 781 842
Concurrent-read      633
Concurrent-write      633
Conditional probability      109
Conditionally independent events      111
Configuration      854
Conjugate transpose      704
Connected component      90 666
Connected graph      90
Connected-Components      415
Connectivity      552
Conservation      535
Consistent      865
Consolidate      402
Constraint graph      501
Continuous uniform probability distribution      109
Contraction      330 349
Convex combination      810
Convex hull      822
Convex layer      834
Convex polygon      305
Convolution      716
Correctness of an algorithm      19
Cost      322
Countably infinite set      81
Counting      101
Counting probabilistic      131

1 2 3 4 5 6 7 8 9 10 11

О проекте