Вход или регистрация
Для отслеживания статуса заказов и рекомендаций
Чтобы видеть сроки доставки
Книга Combinatorial Algorithms: Generation, Enumeration, and Search
![[object Object] «Combinatorial Algorithms: Generation, Enumeration, and Search», авторов Дональд Л. Крехер, Дуглас Р. Стинсон - фото №1](https://static.yakaboo.ua/media/catalog/product/9/7/9780367400156_0.jpg)
4017 грн
Отправка 05.06.24
Бумажная книга
Покупка по частям от 1000 грн
От 3-6 платежей Monobank
Книга Combinatorial Algorithms: Generation, Enumeration, and Search
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:
Many classical areas are covered as well as new research topics not included in most existing texts, such as:
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.
Код товара
20254000
Доставка и оплата
Указать город доставки
Чтобы видеть точные условия доставки
Описание книги 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.
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:
Many classical areas are covered as well as new research topics not included in most existing texts, such as:
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.
Отзывы
Возникли вопросы?
0-800-335-425
4017 грн
Отправка 05.06.24
Бумажная книга
Покупка по частям от 1000 грн
От 3-6 платежей Monobank
Доставка и оплата
Указать город доставки
Чтобы видеть точные условия доставки