R kreher (54 risultati)

Condizione: Fine. 2nd Edition. Used book that is in almost brand-new condition. May contain a remainder mark. Better World Books: Buy Books. Do Good.

Condizione: Very Good. 2nd Edition. Former library copy. Pages intact with possible writing/highlighting. Binding strong with minor wear. Dust jackets/supplements may not be included. Includes library markings. Stock photo provided. Product includes identifying sticker. Better World Books: Buy Books. Do Good.…

Hardcover. Condizione: As New. No Jacket. Pages are clean and are not marred by notes or folds of any kind. ~ ThriftBooks: Read More, Spend Less.

Hardcover. Condizione: Very Good. No Jacket. May have limited writing in cover pages. Pages are unmarked. ~ ThriftBooks: Read More, Spend Less.

Hardcover. Condizione: Very Good. No Jacket. May have limited writing in cover pages. Pages are unmarked. ~ ThriftBooks: Read More, Spend Less.

Condizione: Very Good. Former library copy. Pages intact with possible writing/highlighting. Binding strong with minor wear. Dust jackets/supplements may not be included. Includes library markings. Stock photo provided. Product includes identifying sticker. Better World Books: Buy Books. Do Good.

Condizione: Good. First Edition. CRC Press, 1999. First edition, first printing with full number line; cover very lightly rubbed/bumped, corners ever-so-slightly rubbed, spine ends ever-so- slightly bumped; binding tight; cover, edges, and interior intact and clean except as noted. First Edition. hardcover. Good. …

Condizione: New.

Condizione: As New. Unread book in perfect condition.

Condizione: New.

Condizione: New. pp. 344.

Condizione: New. In.

Condizione: As New. Unread book in perfect condition.

Paperback. Condizione: New. This textbook thoroughly outlines combinatorial algorithms for generation, enumeration, and search. Topics include backtracking and heuristic search methods applied to various combinatorial structures, such as:Combinations Permutations Graphs Designs Many classical areas are covered as well as new research topics not included in most existing texts, such as: Group algorithms Graph isomorphism Hill-climbing Heuristic search algorithms This work serves as an exceptional textbook for a modern course in combinatorial algorithms, providing a unified and focused collection of recent topics of interest in the area. The authors, synthesizing material that can only be found scattered through many different sources, introduce the most important combinatorial algorithmic techniques - thus creating an accessible, comprehensive text that students of mathematics, electrical engineering, and computer science can understand without needing a prior course on combinatorics.…

Condizione: New.

Condizione: New. pp. 344.

Condizione: Gut. Zustand: Gut | Seiten: 454 | Sprache: Englisch | Produktart: Bücher | Keine Beschreibung verfügbar.

Paperback. Condizione: New. This textbook thoroughly outlines combinatorial algorithms for generation, enumeration, and search. Topics include backtracking and heuristic search methods applied to various combinatorial structures, such as:Combinations Permutations Graphs Designs Many classical areas are covered as well as new research topics not included in most existing texts, such as: Group algorithms Graph isomorphism Hill-climbing Heuristic search algorithms This work serves as an exceptional textbook for a modern course in combinatorial algorithms, providing a unified and focused collection of recent topics of interest in the area. The authors, synthesizing material that can only be found scattered through many different sources, introduce the most important combinatorial algorithmic techniques - thus creating an accessible, comprehensive text that students of mathematics, electrical engineering, and computer science can understand without needing a prior course on combinatorics.…

Condizione: New. pp. 344.

hardcover. Condizione: new.

Condizione: Sehr gut. Zustand: Sehr gut | Seiten: 344 | Sprache: Englisch | Produktart: Bücher | This textbook thoroughly outlines combinatorial algorithms for generation, enumeration, and search. Topics include backtracking and heuristic search methods applied to various combinatorial structures, such as: -Combinations -Permutations -Graphs -Designs - Many classical areas are covered as well as new research topics not included in most existing texts, such as: -Group algorithms -Graph isomorphism -Hill-climbing -Heuristic search algorithms - This work serves as an exceptional textbook for a modern course in combinatorial algorithms, providing a unified and focused collection of recent topics of interest in the area. The authors, synthesizing material that can only be found scattered through many different sources, introduce the most important combinatorial algorithmic techniques - thus creating an accessible, comprehensive text that students of mathematics, electrical engineering, and computer science can understand without needing a prior course on combinatorics. …

Condizione: New. Kreher, Donald L. Stinson, Douglas R.This textbook thoroughly outlines combinatorial algorithms for generation, enumeration, and search. Topics include backtracking and heuristic search methods applied to various combinatorial structures, such a.

Hardcover. Condizione: Fine. Near Fine. 3131284544. A fine unread, ex lib. hardcover, in a near fine jacket, from Astra Zeneca. Text in English. 787 pages. Contents, clean, tight and bright. Like new, appears unread. Book.

Hardback. Condizione: New. New copy - Usually dispatched within 4 working days.

Paperback. Condizione: New. This textbook thoroughly outlines combinatorial algorithms for generation, enumeration, and search. Topics include backtracking and heuristic search methods applied to various combinatorial structures, such as:Combinations Permutations Graphs Designs Many classical areas are covered as well as new research topics not included in most existing texts, such as: Group algorithms Graph isomorphism Hill-climbing Heuristic search algorithms This work serves as an exceptional textbook for a modern course in combinatorial algorithms, providing a unified and focused collection of recent topics of interest in the area. The authors, synthesizing material that can only be found scattered through many different sources, introduce the most important combinatorial algorithmic techniques - thus creating an accessible, comprehensive text that students of mathematics, electrical engineering, and computer science can understand without needing a prior course on combinatorics.…

Hardcover. Condizione: Fine. Near Fine. 3131181745. A fine unread, ex lib. hardcover, in a near fine jacket, from Astra Zeneca. Text in English. 828 pages. Contents, clean, tight and bright. Book.

Hardcover. Condizione: New.

Condizione: As New. Unread book in perfect condition.

Hardcover. Condizione: Fine. Near Fine. 3131116943. A fine unread, ex lib. hardcover, in a near fine jacket, from Astra Zeneca. Text in English. 700 pages. Contents, clean, tight and bright. Book.

Condizione: New.