Tight bounds for minimax grid matching, with applications to the average case analysis of algorithms T. Leighton; P. Shor

By: Publication details: Berkeley Mathematical Sciences Research Institute 1986Description: 27 p 29 cm
Tags from this library: No tags from this library for this title. Log in to add tags.
Star ratings
    Average rating: 0.0 (0 votes)
Holdings
Item 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.

to post a comment.

Powered by Koha