Computability, Complexity & Algorithms

Computability, Complexity & Algorithms

МООК
en
Английский
This content is rated 0 out of 5
Source
  • From www.udacity.com
Conditions
  • Self-paced
  • Free Access
More info
  • Introductive Level

Their employees are learning daily with Edflex

  • Safran
  • Air France
  • TotalEnergies
  • Generali
Learn more

Course details

Syllabus

Lesson 1: Computability

* Languages & Countability* Turing Machines* The Church-Turing Thesis* Universality* Undecidability

Lesson 2: Complexity

* P and NP* NP-Completeness* NP-Complete Problems* The Golden Ticket

Lesson 3: Algorithms

* Dynamic Programming* Fast Fourier Transform* Maximum Flow* Maximum Bipartite Matching* Linear Programming* Duality* Randomized Algorithms* Approximation Algorithms

Prerequisite

None.

Instructors

  • Charles Brubaker - Charles Brubaker earned his PhD in Computer Science from Georgia Tech in 2009. He then taught high school computer science and coached basketball at Pace Academy in Atlanta for 4 years. In 2012, inspired by Udacity, he began recording his lectures on a tablet, creating online quizzes, and automatically grading assignments to give his students instant feedback. The success of this enterprise convinced him that Udacity represented the wave of the future in education, and he joined the company in the summer of 2013.
  • Lance Fortnow - Lance Fortnow is professor and chair of the School of Computer Science of the College of Computing at the Georgia Institute of Technology. His research focuses on computational complexity and its applications to economic theory.Fortnow received his Ph.D. in Applied Mathematics at MIT in 1989 under the supervision of Michael Sipser. Before he joined Georgia Tech in 2012, Fortnow was a professor at Northwestern University, the University of Chicago, a senior research scientist at the NEC Research Institute and a one-year visitor at CWI and the University of Amsterdam. Since 2007, Fortnow holds an adjoint professorship at the Toyota Technological Institute at Chicago.
  • Hariharan Venkateswaran - H. Venkateswaran obtained his Ph.D. in Computer Science from the University of Washington in 1986. He then joined the faculty of Georgia Institute of Technology as an Assistant Professor, where he has pursued his research interests in Complexity Theory, Information Security, and Parallel Computation. A renowned teacher on campus, he was awarded "The William A “Gus” Baird Faculty Teaching Award" in 2008.

Editor

Le Georgia Institute of Technology, connu aussi sous le nom de Georgia Tech ou GT, est une université de recherche mixte publique, et située à Atlanta (Géorgie), aux États-Unis. Elle fait partie du réseau plus large du Système universitaire de Géorgie (en anglais, University System of Georgia). Georgia Tech possède des antennes à Savannah (Géorgie, États-Unis), Metz (France), Athlone (Irlande), Shanghai (Chine), et Singapour.

Georgia Tech a acquis sa réputation grâce à ses programmes d'ingénierie et d'informatique, ceux-ci figurant parmi les meilleurs du monde5,6. L'offre de formation est complétée par des programmes dans les domaines des sciences, de l'architecture, des sciences humaines et du management.

Platform

Udacity est une entreprise fondé par Sebastian Thrun, David Stavens, et Mike Sokolsky offrant cours en ligne ouvert et massif.

Selon Thrun, l'origine du nom Udacity vient de la volonté de l'entreprise d'être "audacieux pour vous, l'étudiant ". Bien que Udacity se concentrait à l'origine sur une offre de cours universitaires, la plateforme se concentre désormais plus sur de formations destinés aux professionnels.

This content is rated 4.5 out of 5
(no review)

What did you think of this course?

Complete this resource to write a review