К содержанию
РецензированоEN2021

Algorithms Illuminated Part 4: Algorithms for NP-Hard Problems

Tim Roughgarden

Учебная литература · 2021

Аннотация

This book is the fourth in a series based on my online algorithms courses that have been running regularly since 2012, which in turn are based on an undergraduate course that I taught many times at Stanford University. Part 4 assumes at least some familiarity with asymptotic analysis and big-O notation, graph search and shortestpath algorithms, greedy algorithms, and dynamic programming (all covered in Parts 1–3).

Доказательный фрагмент

«This book is the fourth in a series based on my online algorithms courses that have been running regularly since 2012, which in turn are based on an undergraduate course that I taught many times at Stanford University.»

Образец извлечения

Демо-превью

This book is the fourth in a series based on my online algorithms courses that have been running regularly since 2012, which in turn are based on an undergraduate course that I taught many times at Stanford University. Полный текст публикации CiteX не хранит — доступ к первоисточнику открывается по DOI согласно лицензии издателя и выбранному плану.

DOI не указан
Цитирований
0
Тип
Журнал
Страна
Узбекистан
Спросить CiteX об этой работе

Смежные источники