Normal view MARC view ISBD view

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

By:

Leighton, T

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.

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

Browsing IMAR shelves Close shelf browser (Hides shelf browser)

Previous	No cover image available	No cover image available	No cover image available	No cover image available	No cover image available	No cover image available	No cover image available	Next
Previous	III 28880 Essential sets of fixed points for contractible valued correspondences	III 28881 Consistent conditional systems in noncooperative game theory	III 28882 Newton's method estimates from data at one point	III 28883 Tight bounds for minimax grid matching, with applications to the average case analysis of algorithms	III 28884 Toward a theory of discounted repeated games eith imperfect monitoring	III 28885 Factorizations of lebesgue measure via convolutions	III 28886 Information - based complexity	Next

Contine bibliografie

There are no comments on this title.

to post a comment.

Powered by Koha