Image from Amazon.com
Efficient algorithms for listing combinatorial structures
Material type:
TextLanguage: English Series: Distinguished dissertations in computer sciencePublication details: Cambridge University Press, 1993 Cambridge, New York Description: xv, 160pISBN: - 0521450217 (HB)
- 004.015116 GOL(EFF)
| Item type | Current library | Call number | Copy number | Status | Barcode | |
|---|---|---|---|---|---|---|
Books
|
Central Library | 004.015116 GOL(EFF) (Browse shelf(Opens below)) | 1 | Available | 6709 | |
|
Books
|
Central Library | 004.015116 GOL(EFF) (Browse shelf(Opens below)) | 2 | Available | 6710 |
Total holds: 0
Browsing Central Library shelves Close shelf browser (Hides shelf browser)
|
No cover image available | No cover image available |
|
|
|
No cover image available | ||
| 004.015116 DEZ(GEO) Geometry of cuts and metrics | 004.015116 FLA(ANA) Analytic Combinatorics | 004.015116 GER(COM) Combinatorial number theory and additive group theory | 004.015116 GOL(EFF) Efficient algorithms for listing combinatorial structures | 004.015116 GOL(EFF) Efficient algorithms for listing combinatorial structures | 004.015116 GOR(MAT) Matroids : a geometric introduction | 004.015116 GRA Graph algorithms in the language of linear algebra |
SAR/36/2009/28-05-09
There are no comments on this title.
Log in to your account to post a comment.