Discrete Algorithms and Complexity - Info and Reading Options
Proceedings of the Japan-US Joint Seminar, June 4 - 6, 1986, Kyoto, Japan
By Johnson, David S., Takao Nishizeki and Akihiro Nozaki
"Discrete Algorithms and Complexity" was published by Elsevier Science & Technology Books in 2014 - Burlington, it has 497 pages and the language of the book is English.
“Discrete Algorithms and Complexity” Metadata:
- Title: ➤ Discrete Algorithms and Complexity
- Authors: Johnson, David S.Takao NishizekiAkihiro Nozaki
- Language: English
- Number of Pages: 497
- Publisher: ➤ Elsevier Science & Technology Books
- Publish Date: 2014
- Publish Location: Burlington
Edition Specifications:
- Pagination: 496
Edition Identifiers:
- The Open Library ID: OL40438268M - OL29400419W
- ISBN-13: 9781483274003 - 9780123868701
- All ISBNs: 9781483274003 - 9780123868701
AI-generated Review of “Discrete Algorithms and Complexity”:
Read “Discrete Algorithms and Complexity”:
Read “Discrete Algorithms and Complexity” by choosing from the options below.
Search for “Discrete Algorithms and Complexity” downloads:
Visit our Downloads Search page to see if downloads are available.
Find “Discrete Algorithms and Complexity” in Libraries Near You:
Read or borrow “Discrete Algorithms and Complexity” from your local library.
- The WorldCat Libraries Catalog: Find a copy of “Discrete Algorithms and Complexity” at a library near you.
Buy “Discrete Algorithms and Complexity” online:
Shop for “Discrete Algorithms and Complexity” on popular online marketplaces.
- Ebay: New and used books.