Cake-cutting algorithms:be fair if u can Jack Robertsson and William Webb

By: Robertson, JContributor(s): Webb, W [Auth.]Material type: Text

TextLanguage: English Publication details: Hyderabad UP 1998 Description: x, 181pISBN: 9788173714481Subject(s): ALGORITHMS | IMPOSSIBILITY THEOREMS | RAMSEY PARTITIONSDDC classification: 510.5

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
Book	NISER LIBRARY	510.5 ROB-C (Browse shelf(Opens below))	Available		4433

Previous		No cover image available						Next
Previous	510.5 COR-I Introduction to algorithms	510.5 DOB-M Methods in algorithmic analysis	510.5 DOB-M Methods in algorithmic analysis	510.5 ROB-C Cake-cutting algorithms:be fair if u can	510.5 VAZ-A Approximation algorithms	510.5 YAP-F Fundamental problems of algorithmic algebra	510.51 GOM-I Implicit curves and surfaces:mathematics, data structures and algorithms	Next

There are no comments on this title.

to post a comment.