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

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

blank
blank
blank
 расота
blank
Cover T.M., Gopinath B. Ч Open problems in communication and computation
Cover T.M., Gopinath B. Ч Open problems in communication and computation



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



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


Ќазвание: Open problems in communication and computation

јвторы: Cover T.M., Gopinath B.

јннотаци€:

The papers in this volume are the contributions to a special workshop on problems in communication and computation conducted in the summers of 1984 and 1985 in Morristown, New Jersey, and the summer of 1986 in Palo Alto, California. The structure of this workshop was unique: no recent results, no surveys. Instead, we asked for outstanding open prob- problems in the field. There are many famous open problems, including the question P = NP?, the simplex conjecture in communication theory, the capacity region of the broadcast channel, and the two-helper problem in information theory.


язык: en

–убрика: Computer science/“еори€ информации/

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

ed2k: ed2k stats

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

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

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

ќперации: ѕоложить на полку | —копировать ссылку дл€ форума | —копировать ID
blank
ѕредметный указатель
Abnormal linear code      54
Additive Gaussian noise channel      70
Algorithmic information content      see УProgram-size complexityФ
Algorithmic information theory      108
Alphabet      50 84
Amplitude-constrained pulse      46
Asynchronous cellular arrays      120Ч121
Asynchronous computation      161Ч162
Average case complete problems      106
Average mutual information      75Ч76
Bayes rules      85Ч91
Berlekamp Ч Massey algorithm      114Ч115
Berlekamp's light-bulb game      51Ч55
Berry paradox      110Ч111
Binary decision trees      145Ч146
Binary questions      154 210Ч216
Binary trees      130Ч137
Boolean functions      57Ч58 77Ч82 217Ч219
Bounded functions      32Ч34 46Ч48 191Ч198
Boxcar spectrum      47Ч48 191Ч193
Broadcast channel, capacity region      39
Broadcast networks      60Ч62 208Ч209
Brownian motion      155 204Ч207
Brunn Ч Minkowski inequality      172
Busy Beaver function      108Ч111
Call attempts      64Ч68
Call rearrangement      100
Cantor's diagonal construction      109
Catalan numbers      131Ч132
Cayley Ч Hamilton theorem      114Ч115
Cellular arrays      120Ч121
Cellular Automata Machine simulator      120
Cellular radio      100Ч101
Cesaro convergence      194
Channel input/output      93Ч94
Circuit simulation      80Ч82
Circuit switching      63
Circuit-switched network      68
clocks      122
codes      51Ч55 59 145Ч146
Collatz problems      25Ч26
Combinatorial complexity      77Ч78
Communication complexity      123Ч124 144
Complexity problems      57Ч58
Compositional complexity      78
concurrency control      63
conflict resolution      210Ч216
Conjugate gradient      114
Continued fraction algorithm      115
Coordination complexity      217Ч218
Coppersmith, Odlyzko, and Schroeppel algorithm      115
Correlation inequalities      40
Cost      78Ч79
Covering radii      50Ч55
Cryptography      106
Cryptosystems      113
Cyclic codes      55
Data processing inequality      75
decision-making      49Ч50 77 78
Digital signature schemes      138
Discrete logarithms      113Ч116
Discrete memoryless channel (DMC)      29 59 72Ч73
Discrete memoryless models      32
Distributed shortest path algorithms      123Ч124
Divergence characterization      30
Dynamic programming      154
Dynamic routing      63
Electrical conductivity      164
Electrical tomography      see УTomographyФ
entropy      77Ч78 79 82
Entropy characterization      29 30
Entropy power inequality      172
Equidistribution      41
Ergodic convergence theorem      201
Ergodic process selection      153 199Ч203
Ergodic processes      38 192
Factorization      113Ч119
Fast algorithms      107 113
Faster binary signaling (FBS)      98
Feedback      40 70Ч71
Fermat's conjecture      109Ч110
Figure-ground problem      171
Filter transfer function      46
First-order Reed Ч Muller codes      55
Flip distance      132Ч133
Flow patterns      165
Fourier transform      46
FRACTRAN      3Ч26
Fredman Ч Komlos proof      32 33
Frequency assignment, cellular radio      100Ч101
Frobenius Ч Perron theorem      184
Fuch's inequality      129
Gacs Ч Reif model      120
Gaussian channels      44 70Ч71
Gaussian elimination      113
Gaussian random process      48
Generic rank      158Ч159
Gibbs random fields      38
Goedel's incompleteness theorem      110Ч111
Goldbach conjecture      109Ч110
Graph entropy      32 33
Graph theory      49Ч50
Halting problem      109 110Ч111
Hamming weight      145
Hardness      106 107
Highly distributed information      60Ч62
Image size characterization      29 30
Independent sets      142Ч143
Information divergence      85Ч91
Information rate      96Ч98
Interacting particle systems      63
Inverting      107
Irrationality measure for $\pi$      20
Jamming      30
Justesen code      107
Klawe's configuration      101
Kleene's normal form theorem      25
Knapsacks      113 117Ч119
Kolmogorov forward equation      148
Kolmogorov Ч Chaitin complexity      78
Kullback Ч Leibler divergence      30 37 85Ч91
Lanczos algorithms      114
Laplace's equation      167
Light-bulb game      51Ч55
Linear programming (LP)      96 101
Linear separability      156Ч157
Lyapunov stability, time-varying linear systems      161
Magnetic media storage      46
Markov processes      64 66 122 148
Martingale convergence theorem      201
Martingales      87 201
Matrices, stability of products      161Ч163
Maximally separated signals      92Ч98
Maximum entropy (ME) principle      37Ч38
Maximum matching problem      147Ч150
MEX machines      217Ч218
Microwave radio links      46
Minimum discrimination principle      see УMaximum entropy (ME) principleФ
Minimum hop problem      123Ч124
Moment constraints      153n.
Monotone Boolean functions      57Ч58
Morrison Ч Brillhart algorithms      118
Multilevel Nyquist signaling (MNS)      97Ч98
Multiple access protocols      210Ч211
Multiuser information theory      29Ч30 39Ч40 60
Multivariate polynomial equations      138
networks      60Ч62 63Ч68
Networks, flow      158Ч159
Networks, in tomography      164Ч170
Networks, instability      63Ч68
Noise      60Ч62 144 208Ч209
Noiseless coding      40
Nonprobabilistic channels      39
Normal form      77Ч82
NP-complete problems      106
Nyquist rate      97Ч98
One-dimensional network      64Ч66
One-way functions      104Ч105
Optical communication channels      43Ч45
Optimum pulse shaping      95Ч96
Optimum sequence of questions      154 210Ч216
Optimum signaling rate      96Ч98
Optional sampling theorem      204
Orbital codes      59
Packet-Switched Network      68
Partial statistics      84
Pattern recognition      77Ч82
Perfect cubes      117
Perfect hashing      32Ч34 127n
Permanent inequality      127Ч129
Phase transition      63
Poisson kernel      205
Poisson process      43
Pomerance quadratic sieve      115
Predictive density      89Ч90
Probability density functions      85Ч91
probability distribution      155
Program-size complexity      108Ч111
Pulse amplitude modulated (PAM) signals      95Ч96
Queueing      68 139Ч141
Random access strategies      127Ч129
Random pairs      156
random selection      41
Random walks      155 204Ч207
Rate-Distortion function      59
Read/write complexities      145Ч146
Receiver noise model      61
Reed Ч Muller codes      55
Relative entropy      see УKullback Ч Leibler divergenceФ
Relay channel capacity      72Ч73
Reliable communication      60Ч62 208Ч209
Reliable computation      120Ч121
resistors      165Ч167
Reyneri cubic sieve      118
Rhythm      171
Riemann hypothesis      109Ч110
Ring networks      62
Rotation distance      130Ч137
RSA Signature Scheme      113 138
Rudin Ч Shapiro polynomials      143
Sample partitioning      154 210Ч216
Saturation      125
Schnorr Ч Lenstra algorithm      115
Schroeppel linear sieve      115
Schwartz Ч Christoffel formula      205
Scope      125Ч126
Secretary problem      152
Selection functions      153
Selection strategies      199Ч203
Self-adjusting search trees      133
Shannon's entropy      78 79
Shannon's Information Theory      29Ч30 60
Shifts      144
Shortest path problem      123Ч124
Signal sets      43Ч45
Simplex conjecture      74 155 204Ч207
Simulated annealing      147Ч150
Single-letterization      29 35Ч36 39
Small primes      117Ч118
Smooth integers      117Ч118
Sound      171
Sparse systems      114
Spectral density      46Ч48 191Ч198
Splitting numbers      152
State trajectories      140
Stationary distributions      63Ч68
Stationary random process      46 47
Statistical mechanics      149Ч150
Stochastic decision problems      49Ч50
Stochastic processes      191 Ч198
Stochastic relaxation      147Ч150
Straight-line (SL) algorithms      104Ч105
Strassen' s algorithm      113
Strings, derivation, generation, and parsing      173Ч188
Structurally fixed modes      158Ч160
Structured matrices      158Ч160
Team decision problem      49Ч50
Threshold detection system      145Ч146
Tiling      106 142Ч143
Time complexity      124
Time-varying linear systems      161
Tomography      164Ч168
Toom's rule      121
Transmitter noise model      61Ч62
Transversals      40
Trapdoor functions      107
Tree network      62 67
Triangulation      132Ч136
Trigonometric polynomials      142Ч143
Turing Machines      79 104Ч105 108Ч111
Two-dimensional network      67Ч68
Universal data compression      84
Universal discriminant function      84
Universal gates      78 80Ч81
Wallis' product      19
waveforms      46Ч47
White Gaussian noise      71 94
Work factor      104Ч105
Write complexities      see УRead/write complexitiesФ
Wyner's wiretap channel      30
X-ray tomography      see УTomographyФ
Zarankiewic's problem      58
УLacunaryФ information pattern      50
УMove-alonФ policy      139Ч141
blank
–еклама
blank
blank
HR
@Mail.ru
       © Ёлектронна€ библиотека попечительского совета мехмата ћ√”, 2004-2022
Ёлектронна€ библиотека мехмата ћ√” | Valid HTML 4.01! | Valid CSS! ќ проекте