In addition to the notes on the initial topics, here are some notes for the topics in the incompressibility method.

• Lower Bound for Palindromes on Single-Tape Turing Machines
• Lower Bound for the Coin Weighing Problem
• Hartmanis' Oracle A such that P^A != NP^A
• Communication Complexity Lower Bounds