Зарегистрироваться
Восстановить пароль
FAQ по входу

Теория алгоритмов

H
Manning Publications Co., 2020. — 320 p. — ISBN: 978-1617296185. Grokking Artificial Intelligence Algorithms is a fully-illustrated and interactive tutorial guide to the different approaches and algorithms that underpin AI. Written in simple language and with lots of visual references and hands-on examples, you’ll learn the concepts, terminology, and theory you need to...
  • №1
  • 11,87 МБ
  • добавлен
  • описание отредактировано
K
2nd Edition. — Springer, 2016. — 2428 p. — ISBN: 978-1-4939-2864-4 (eBook). This dynamic reference work provides solutions to vital algorithmic problems for scholars, researchers, practitioners, teachers and students in fields such as computer science, mathematics, statistics, biology, economics, financial software, and medical informatics. This second edition is broadly...
  • №2
  • 26,36 МБ
  • добавлен
  • описание отредактировано
ACM Books, 2023. — 426 p. — ISBN: 979-8-4007-0778-0. Professor Stephen A. Cook is a pioneer of the theory of computational complexity. His work on NP-completeness and the P vs. NP problem remains a central focus of this field. Cook won the 1982 Turing Award for "his advancement of our understanding of the complexity of computation in a significant and profound way." This volume...
  • №3
  • 1,98 МБ
  • добавлен
  • описание отредактировано
Independently published, 2020. — 346 p. — ISBN B08LD1NKL1. An Algorithm is a sequence of steps to solve a problem. Design and Analysis of Algorithm is very important for designing algorithm to solve different types of problems in the branch of computer science and information technology. This book introduces the fundamental concepts of Designing Strategies, Complexity analysis...
  • №4
  • 13,20 МБ
  • добавлен
  • описание отредактировано
В этом разделе нет файлов.

Комментарии

В этом разделе нет комментариев.