Tight bounds for minimax grid matching, with applications to the average case analysis of algorithms T. Leighton; P. Shor
Publication details: Berkeley Mathematical Sciences Research Institute 1986Description: 27 p 29 cmItem type | Current library | Call number | Status | Date due | Barcode | |
---|---|---|---|---|---|---|
Carti | IMAR | III 28883 (Browse shelf(Opens below)) | Available | 0027315 |
Contine bibliografie
There are no comments on this title.
Log in to your account to post a comment.