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

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

blank
blank
blank
Красота
blank
Leeuwen J. (ed.), Meyer A.R., Nivat M. — Algorithms and Complexity, Volume A
Leeuwen J. (ed.), Meyer A.R., Nivat M. — Algorithms and Complexity, Volume A



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



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

Название: Algorithms and Complexity, Volume A

Авторы: Leeuwen J. (ed.), Meyer A.R., Nivat M.

Аннотация:

Modern developments in computer and software systems have raised many challenging issues concerning the design and efficiency of complex programming applications. There is an increasing need for "advanced theory", to understand and exploit basic concepts and mechanisms in computing and information processing. The Handbook of Theoretical Computer Science is designed to provide a wide audience of professionals and students in Computer Science and related disciplines with an overview of the major results and developments in the theoretical exploration of these issues to date.


Язык: en

Рубрика: Computer science/

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

ed2k: ed2k stats

Издание: 1st edition

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

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

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

Операции: Положить на полку | Скопировать ссылку для форума | Скопировать ID
blank
Предметный указатель
$#P$      106—107
$#P$-equivalent      108
$#P_{1}$      109
$(a, b)$-tree      309
$Access$      305
$AC^{0}$      140
$AC^{0}$-reducible      772
$AC^{0}_{k}$      135
$AC’$      766
$AT^{2}$-complexity      842
$awk$      260
$B$-Voronoi diagram      409
$BH_{k}$      93
$BW^{0}_{k}$      142
$Change Weight$      3 20
$d$-dimensional worktape      228
$Decreasekey$      327
$Delete$      305
$Deletemin$      326
$Deunion$      325
$D^{P}$      93
$egrep$      260
$fgrep$      278
$Find$      324
$Findmin$      326
$FNC^{k}$      135
$FP^{NP}$      92
$FP^{NP}[log n]$      95
$F\Delta^{P}_{2}$      92
$grep$      261
$Insert$      305
$Join$      320
$k$-ary tree      313
$k$-connected component      529
$k$-enumeratively-rankable      246
$k$-set      378
$k-d$ tree      370
$lex$      260
$Makequeue$      326
$Meld$      326
$n$-string      205
$NC^{1}$      138—143
$NC^{1}$, $U_{E^{*}}$-uniform      139
$NC^{1}$, log-space uniform      138
$NC^{1}$, P-uniform      138
$NC^{1}$-reduction      136
$NC^{2}$      136—138
$NC^{k}$      135
$palstars$      290
$prefixsquares$      290
$P^{#P}$      109
$P^{NP[logn]}$      95
$P^{NP}$      92
$P^{PP}$      120
$S-m-n$ Theorem      179
$s-t$ cut      589
$s-t$ flow      589
$s-t$ numbering      882
$SC^{k}$      127
$sl_{2}$-module      658
$Split$      320
$TC^{0}$      142
$Union — Find$ problem      324
$Union — Split-Find$ problem      324
$Union$      324
$Union$, weighted      325
$\bigoplus P$      110
$\Delta$-structure      32
$\Delta^{P}_{2}$      92
$\Delta^{P}_{k}$      96
$\gamma$-reduction      90
$\lambda$-matrix      378
$\omega$-flow      854
$\omega$-separable      851
$\Pi^{P}_{k}$      96
$\Sigma^{P}_{k}$      96
(2—3)-tree      309
2-edge connectivity      885
2-SATISFIABILITY      86
3-PARTITiON      87
3-Satisfiability      86
a priori probability      210
Abelian group      685
Abelian variety test      712
Abstract complexity      180
Abstract data type      303
AC      38
ACC      142
Acceptance      8
Acceptance problem (for Turing machines)      80
Acceptance, (of a language)      244
Acceptance, space-bounded      11
Acceptance, time-bounded      11
Accepted language      8
Accepting computation tree      43
Accepting configuration      8
Access frequency      305
Access time, ideal      320
Accessibility problem for forests      137
Accessibility problem for graphs      128—129
Accessibility problem for path systems      126
Accumulator      23
Accumulator, vector      51
Ackermann’s function, inverse of      423
Addition      875—876
Addition chain      637
Additive-constant speed-up      167
Additivity conjecture      651
Adjacency list      536
Adjacency matrix      532
Admissible construction      436
Admissible selection function      192
Adversary      719
advice      116
Advice sequence      762
AEXPTIME      44
Aho — Corasick algorithm      273
Ajtai, Koml$\acute{o}$s and Szemer$\acute{e}$di Theorem      820
Alder — Strassen bound      657
Algebra      650
Algebra, associative      650
Algebra, division      657
Algebra, generalized null      657
Algebra, group      657
Algebra, Lie      657
Algebra, of minimal rank      657
Algebra, of quaternions      657
Algebraic complexity      399
Algebraic complexity theory      633
Algebraic computation      635
Algebraic decision problem      647
Algebraic decision tree      347
Algebraic decomposition, cylindrical      401
Algebraic equation      637
Algebraic inequality      637
Algebraic manipulation      641
Algebraic roadmap      403
Algebraic surface      398
Algorithm, Aho — Corasick      273
Algorithm, baby-step-giant-step      686
Algorithm, Boyer — Moore      267
Algorithm, class group composition      682
Algorithm, class group reduction      681
Algorithm, Commentz — Walter      278
Algorithm, continued fraction      701
Algorithm, cubic sieve      705
Algorithm, decryption      719
Algorithm, Dijkstra’s      559
Algorithm, encryption      719
Algorithm, Euclid’s      646
Algorithm, Ford’s      558
Algorithm, Goldberg — Tarjan (for maximum flows)      599
Algorithm, Gomory — Hu      606
Algorithm, Horspool’s      271
Algorithm, Hunt — Szymanski      292
Algorithm, index-calculus      690
Algorithm, Knuth — Morris-Pratt      264
Algorithm, Knuth — Schonhage      647
Algorithm, Las Vegas      115
Algorithm, linear sieve      694
Algorithm, McNaughton — Yamada      286
Algorithm, Monte Carlo      115
Algorithm, optimal      638
Algorithm, probabilistic      554
Algorithm, quadratic sieve      697
Algorithm, Rabin — Karp      263
Algorithm, random squares      700
Algorithm, randomized      233
Algorithm, reduction      681
Algorithm, systolic      864
Algorithm, Thompson’s      282
Algorithm, two-thirds      701
Algorithm, Warshall’s      541
Algorithms, analysis of      see Analysis of algorithms
ALOGSPACE      44
ALOGTIME      139
Alphabet      7
Alphabet, tape      17
Alternating path      582
Alternating Turing machine (ATM)      43 73—74
Alternation      42
AM      123
Ambiguous form      682
Amortized analysis      304
AM[poly]      122—123
Analysis of Algorithms      16
Analysis of algorithms, asymptotics      445
Analysis of algorithms, average-case      433
Analysis of algorithms, enumeration      434
Analysis of algorithms, hashing      492
Analysis of algorithms, searching      481
Analysis of algorithms, sorting      458
Analysis of algorithms, trees      436
Analysis, amortized      304
Analysis, average-case      303
Analysis, worst-case      303
Analytic function      447
Anonymous transaction      747
Approximate string matching      293
Approximation method      781
Approximator      774
Approximator circuit      781
APSPACE      44
APTIME      44
Area      840
Area, active      840
Area, total      840
Arithmetic      23
Arithmetic circuit      635
Arrangement      377
Arrangement, faces of      399
Array processing machine      51
Art Gallery Problem      366
Arthur — Merlin game      122
ASPACE[$S(n)$]      98
ASSIGNMENT      808
Asymptotic analysis      445
Asymptotic complexity      652
Asymptotic degeneration      654
Asymptotic rank      652
Asymptotic spectrum      653
ATIME[$T(n)$]      98
ATM      see Alternating Turing machine
Attack (in cryptography), chosen-ciphertext      731
Attack (in cryptography), chosen-message      741
Attack (in cryptography), chosen-plaintext      734
Attack (in cryptography), known-plaintext      731
Attack (in cryptography), ‘meet-in-the-middle’      734
Augmentation (of a flow), clairvoyant      594
Augmentation (of a flow), Dantzig      598
Augmentation (of a flow), Dinic      596
Augmentation (of a flow), Edmonds — Karp      594
Augmentation (of a flow), Edmonds — Karp minimum cost      604
Augmentation (of a flow), Ford — Fulkerson      594
Augmentation (of a flow), maximum capacity      594
Augmenting bipath      610
Augmenting bipath theorem      611
Augmenting path      589
Augmenting path theorem      590
Authentication      720
Automatic graph drawing      528
Automorphism group (of a graph)      577
Average-case analysis      304
Average-case complexity      433
AVL-tree      309
B-tree      309
Baby-step-giant-step algorithm      686
Back referencing      261
Baker — Gill-Solovay oracle      241
Balanced tree      309
Bandwidth      546
Bandwidth, (in VLSI theory)      862
Basis (of Boolean functions)      787
Basis (of Boolean functions), binary      787
Basis (of Boolean functions), DeMorgan      787
Basis (of Boolean functions), monotone      787
Baur — Strassen inequality      644
Bayes’ rule      216
BB[$\alpha$]-tree      309
Bellman’s equations      558
Bezout’s Theorem      641
BFS      see Breadth-first search
BFS tree      539
BH      94
Biaugmentation      610
Biaugmentation, Hu-      611
Biaugmentation, Itai-      611
Bibliographic search      278
Biconnected component      529
Biconnectivity      882
Bilinear complexity      650
Bilinear map      650
Bilinear map, format of      656
Bimodal polynomials method      694
Binary basis (of Boolean functions)      787
Binary formula      787
Binary quadratic form      681
Binary search tree      470
Binary tree      436
Binary-balanced tree      309
Bipath, augmenting      610
Bisection, of a point set      378
Bitonic sort      890—892
Blank symbol      7
Block      529
Block-sensitivity      896
Blum axioms      165
Blum complexity measure      180
Boolean circuit      760 (see also Circuit)
Boolean circuit, depth of      75
Boolean circuit, family      75—76
Boolean circuit, fan-in      76
Boolean circuit, fan-out      76
Boolean circuit, nonuniform      75
Boolean circuit, oracle-augmented      136
Boolean circuit, representation of graphs by      104
Boolean circuit, size of      75
Boolean circuit, unbounded fan-in      140—141
Boolean circuit, uniform      75
Boolean circuit, width of      75
1 2 3 4 5 6 7 8
blank
Реклама
blank
blank
HR
@Mail.ru
       © Электронная библиотека попечительского совета мехмата МГУ, 2004-2024
Электронная библиотека мехмата МГУ | Valid HTML 4.01! | Valid CSS! О проекте