Зарегистрироваться
Восстановить пароль
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
  • 9,11 МБ
  • добавлен
  • описание отредактировано
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
  • 39,12 МБ
  • добавлен
  • описание отредактировано
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,10 МБ
  • добавлен
  • описание отредактировано
S
Independently published, 2023. — 102 p. Алгоритмы Grokking: простые и эффективные методы глубокого и машинного обучения Grokking In the past decade, Artificial Intelligence has been making waves. From self-driving cars to Siri to Alexa, Artificial Intelligence (AI) is everywhere. But what exactly is it? The term "artificial intelligence" was coined in 1956 by John McCarthy, a...
  • №4
  • 2,26 МБ
  • добавлен
  • описание отредактировано
В этом разделе нет файлов.

Комментарии

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