Inbunden, Engelska, 1998
Combinatorial Algorithms
Generation, Enumeration, and Search
Av Donald L. Kreher, Douglas R. Stinson
Del i serien Discrete Mathematics and Its Applications
2136 kr
Beställningsvara. Skickas inom 10-15 vardagar. Fri frakt över 249 kr.
Beskrivning
Produktinformation
- Utgivningsdatum: 1998-12-18
- Mått: 156 x 234 x 22 mm
- Vikt: 660 g
- Format: Inbunden
- Språk: Engelska
- Serie: Discrete Mathematics and Its Applications
- Antal sidor: 342
- Förlag: Taylor & Francis Inc
- ISBN: 9780849339882
Utforska kategorier
Mer om författaren
Kreher, Donald L.; Stinson, Douglas R.
Recensioner i media
"Very clear exposition. I jumped right into [the] heuristic methods chapter and understood it almost instantly..."- Dean H. Judson, Ph.D., Nevada State Demographer"…book serves as an introduction to the basic problems and methods…style is clear, transparent…The algorithmic problems are always considered and they are in the center of the discussion…has a fresh approach to combinatorics that is available for readers, students in computer science, electrical engineering without any background in mathematics."- Péter Hajnal, Acta Science Math
Betyg & recensioner
0 recensioner
Inga recensioner tillgängliga.