Normal view MARC view ISBD view

On fast heuristic for minimum edge length rectangular partition D. Z. Du

By:

Du, D. Z

Publication details: Berkeley Mathematical Sciences Research Institute 1986Description: 39 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 28865 (Browse shelf(Opens below))	Available		0027279

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 28862 Cost share equilibria: A Lindahlian Approach	III 28863 Rudiments of a average case complexity theory for piecewise-linear path following algorithms	III 28864 An extension of the black-scholes model of redundant security valuation	III 28865 On fast heuristic for minimum edge length rectangular partition	III 28866 Fine structure of prime-ends	III 28867 The dimension of extremal sets	III 28868 Can sunspots replace a mediator?	Next

Contine bibliografie

There are no comments on this title.

to post a comment.

Print
Add to your cart (remove)
Save record
BIBTEX Dublin Core MARCXML MARC (non-Unicode/MARC-8) MARC (Unicode/UTF-8) MARC (Unicode/UTF-8, Standard) MODS (XML) RIS ISBD
More searches

Search for this title in:
Other Libraries (WorldCat) Other Databases (Google Scholar) Online Stores (Bookfinder.com) Open Library (openlibrary.org)

Powered by Koha