Awesome-Mirrors
/
awesome-courses
mirror of https://github.com/prakhar1989/awesome-courses.git
1
0
Fork 0
Code Issues Packages Projects Releases Wiki Activity

Merge pull request #288 from Ghost93/Ghost93-cs6810-fix-links 

Fix CS 6810 @ Cornell and update to 2016 version
This commit is contained in:
Prakhar Srivastav 2019-01-16 10:21:35 -08:00 committed by GitHub
parent 00da5fdfa4 cf8b83f28a
commit 8901ed5db5
No known key found for this signature in database
GPG Key ID: 4AEE18F83AFDEB23
1 changed files with 4 additions and 4 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

8
README.md
View File

@ -456,7 +456,7 @@ Courses
- [Syllabus](http://www.cs.cornell.edu/~dsteurer/toc13/syllabus/)
- [Lectures](http://www.cs.cornell.edu/~dsteurer/toc13/lectures/)
- [Assignments](http://www.cs.cornell.edu/~dsteurer/toc13/homework/)
- [CS 6810](http://www.cs.cornell.edu/~dsteurer/complexity12/) **Theory of Computing** *Cornell University* <img src="https://assets-cdn.github.com/images/icons/emoji/unicode/1f4bb.png" width="20" height="20" alt="Assignments" title="Assignments" /> <img src="https://assets-cdn.github.com/images/icons/emoji/unicode/1f4dd.png" width="20" height="20" alt="Lecture Notes" title="Lecture Notes" /> <img src="https://assets-cdn.github.com/images/icons/emoji/unicode/1f4da.png" width="20" height="20" alt="Readings" title="Readings" />
- [CS 6810](https://complexity16.dsteurer.org/) **Theory of Computing** *Cornell University* <img src="https://assets-cdn.github.com/images/icons/emoji/unicode/1f4bb.png" width="20" height="20" alt="Assignments" title="Assignments" /> <img src="https://assets-cdn.github.com/images/icons/emoji/unicode/1f4dd.png" width="20" height="20" alt="Lecture Notes" title="Lecture Notes" /> <img src="https://assets-cdn.github.com/images/icons/emoji/unicode/1f4da.png" width="20" height="20" alt="Readings" title="Readings" />
- This graduate course gives a broad introduction to complexity theory, including classical results and recent developments. Complexity theory aims to understand the power of efficient computation (when computational resources like time and space are limited). Many compelling conceptual questions arise in this context. Most of these questions are (surprisingly?) difficult and far from being resolved. Nevertheless, a lot of progress has been made toward understanding them (and also why they are difficult). We will learn about these advances in this course. A theme will be combinatorial constructions with random-like properties, e.g., expander graphs and error-correcting codes. Some examples:
- Is finding a solution inherently more difficult than verifying it?
- Do more computational resources mean more computing power?
@ -464,9 +464,9 @@ Courses
- Are randomized algorithms more powerful than deterministic ones?
- Is it easier to solve problems in the average case than in the worst case?
- Are quantum computers more powerful than classical ones?
- [Syllabus](http://www.cs.cornell.edu/~dsteurer/complexity12/)
- [Lectures](http://www.cs.cornell.edu/~dsteurer/complexity12/#lectures)
- [Assignments](http://www.cs.cornell.edu/~dsteurer/complexity12/#homework)
- [Syllabus](https://complexity16.dsteurer.org/syllabus/)
- [Lectures](https://complexity16.dsteurer.org/lectures/)
- [Assignments](https://complexity16.dsteurer.org/homework/)
- [CSCE 3193](http://www.csce.uark.edu/~sgauch/3193/S11/index.html) **Programming Paradigms** *University of Arkansas (Fayetteville)* <img src="https://assets-cdn.github.com/images/icons/emoji/unicode/1f4bb.png" width="20" height="20" alt="Assignments" title="Assignments" /> <img src="https://assets-cdn.github.com/images/icons/emoji/unicode/1f4dd.png" width="20" height="20" alt="Lecture Notes" title="Lecture Notes" />
- Programming in different paradigms with emphasis on object oriented programming, network programming and functional programming. Survey of programming languages, event driven programming, concurrency, software validation.
- [Syllabus](http://www.csce.uark.edu/~sgauch/3193/S11/syllabus.html)