Monday, December 4, 2017

Day 40

Final Day of Class. It's been a good ride.

Assignment 4 has been graded and solutions on the resource page. Assignment 5 is due December 13. Because of the limited time for grading there will be no extensions and a 1 point/hour late penalty. If you have any other uncompleted assignments they will also be due December 13 for partial credit.

We covered a Kolmogorov complexity version of Robin Moser's proof of the Lovász local lemma.
Hope you enjoyed the class and may all your lives be complete!

Friday, December 1, 2017

Day 39

Prefix-free complexity and the universal measure

Wednesday, November 29, 2017

Day 38

Assignment 5 has been posted and due December 13.

Assignment 4 is still being graded but solutions have been posted on the T-Square resources page.

Introduction to Kolmogorov complexity with basic results, applications to primes and mathematical logic.

Monday, November 27, 2017

Day 37

Guest lecture by DeVon Ingram on the Sensitivity Conjecture and GKS games.

Monday, November 20, 2017

Day 36

The following are polynomial related for any function f:{0,1}n→{0,1}.

  • Decision Tree Complexity (deterministic query complexity)
  • Certificate Complexity
  • Block Sensitivity
  • Degree of approximate polynomial
  • Degree of exact polynomial
  • Quantum query complexity

Saturday, November 18, 2017

Day 35

Shor's Algorithm - polynomial-time quantum algorithm for factoring

Wednesday, November 15, 2017