| 000 | 00437 a2200133 4500 | ||
|---|---|---|---|
| 035 | _a | ||
| 090 |
_c24791 _d24791 |
||
| 100 | _aLeighton, T | ||
| 245 |
_aTight bounds for minimax grid matching, with applications to the average case analysis of algorithms _cT. Leighton; P. Shor |
||
| 260 |
_aBerkeley _bMathematical Sciences Research Institute _c1986 |
||
| 300 |
_a27 p _c29 cm |
||
| 500 | _aContine bibliografie | ||
| 942 |
_aIMAR _cCART _sSN |
||
| 999 |
_c24501 _d24501 |
||