YoVDO

Hamiltonian Paths in Antiquity - Stanford Lecture 2016

Offered By: Stanford University via YouTube

Tags

Graph Theory Courses Combinatorics Courses Algorithm Analysis Courses

Course Description

Overview

Save Big on Coursera Plus. 7,000+ courses at $160 off. Limited Time Only!
Explore the fascinating history of Hamiltonian paths in this Stanford lecture by renowned computer scientist Donald Knuth. Delve into the origins of the Icosian Game, invented by William Rowan Hamilton around 1850, which involves finding a path that encounters all points of a network without retracing steps. Discover how variants of this game have become crucial in modern computer applications. Uncover evidence suggesting that interest in such questions dates back to Graeco-Roman times, and examine ingenious Sanskrit and Arabic documents from the ninth century onwards. Learn why this problem may be considered the oldest nontrivial combinatorial challenge in the history of civilization. Gain insights from Knuth, the "father" of algorithm analysis and author of The Art of Computer Programming, as he presents this captivating 72-minute Christmas Tree Lecture in 360-degree format.

Syllabus

Stanford Lecture: Don Knuth—"Hamiltonian Paths in Antiquity" (2016) (360 Degrees)


Taught by

Stanford Online

Tags

Related Courses

Aplicaciones de la teoría de grafos a la vida real
Miríadax
Aplicaciones de la Teoría de Grafos a la vida real
Universitat Politècnica de València via UPV [X]
Introduction to Computational Thinking and Data Science
Massachusetts Institute of Technology via edX
Genome Sequencing (Bioinformatics II)
University of California, San Diego via Coursera
Algorithmic Information Dynamics: From Networks to Cells
Santa Fe Institute via Complexity Explorer