Efficient Algorithms for Listing Combinatorial Structures
By: Goldberg, L. A.
Material type: BookSeries: Distinguished Dissertations in Computer Science.Publisher: Cambridge Cambridge University Press 1993Description: xiv, 160p.ISBN: 978-0-521-45021-8.Item type | Current location | Call number | Status | Date due | Barcode |
---|---|---|---|---|---|
005.73 GOL (Browse shelf) | Available | 506344 |
Browsing International Institute of Information Technology Bangalore Shelves Close shelf browser
005.73 AHO (CR) Data structures and algorithms | 005.73 AHO (CR) Data structures and algorithms | 005.73 BUD Classic data structures in C++ | 005.73 GOL Efficient Algorithms for Listing Combinatorial Structures | 005.73 KAN Data structures through C | 005.73 KAN Data structures through C++ | 005.73 KAN Data structures through c, 2nd. Edition. |
There are no comments for this item.