Publication:
Introduction To Algorithms (SMA 5503)

dc.contributor.author Charles Leiserson, Erik Demaine
dc.date.accessioned 2023-11-23T07:00:32Z
dc.date.available 2023-11-23T07:00:32Z
dc.date.issued 2005
dc.description Courses: Cấu trúc dữ liệu và giải thuật ; Included Materials: Syllabus, Video Lectures, Readings, Assignments, Exams ; Source: https://ocw.mit.edu/courses/6-046j-introduction-to-algorithms-sma-5503-fall-2005/ ; Language: Eng ; Publisher: MIT Open Courseware
dc.description.abstract This course teaches techniques for the design and analysis of efficient algorithms, emphasizing methods useful in practice. Topics covered include: sorting; search trees, heaps, and hashing; divide-and-conquer; dynamic programming; amortized analysis; graph algorithms; shortest paths; network flow; computational geometry; number-theoretic algorithms; polynomial and matrix calculations; caching; and parallel computing
dc.identifier.uri http://repository.vlu.edu.vn:443/handle/123456789/10369
dc.language.iso en_US
dc.title Introduction To Algorithms (SMA 5503)
dc.type Resource Types::text::lecture
dspace.entity.type Publication
oairecerif.author.affiliation #PLACEHOLDER_PARENT_METADATA_VALUE#
Files
Original bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
CM91.txt
Size:
0 B
Format:
Plain Text
Description: