The Master theorem for calculating the time complexity of recurrence relations (divide and conquer algorithm
Loading...
Date
Authors
ORCID
DOI
item.page.thesis.degree.name
item.page.thesis.degree.level
item.page.thesis.degree.discipline
item.page.thesis.degree.department
item.page.thesis.degree.grantor
item.page.thesis.degree.advisor
item.page.thesis.degree.committeeMember
Journal Title
Journal ISSN
Volume Title
Publisher
Kharkiv : V. N. Karazin Kharkiv National University
Abstract
Description
Керівник роботи: Полякова Людмила Юріївна, старший викладач, кандидат фізико-математичних наук кафедри теоретичної та прикладної інформатики
Citation
Zhu, Yanming. The Master theorem for calculating the time complexity of recurrence relations (divide and conquer algorithm : master’s thesis : specialty Computer Sciences and Information Technologies : educational program "Informatics" / Ya. Zhu ; supervisor L. Yu. Polyakova. – Kharkiv : V. N. Karazin Kharkiv National University, 2024. – 44 с.