Section outline

  • ΔΕΥΤΕΡΑ

    • Non-Uniform Complexity: Boolean Circuits, the class P/poly, Advice Turing Machines, Circuit Lower Bounds, Natural Proofs

    ΠΕΜΠΤΗ

    • Counting Complexity: The Class #P, #P-completeness & The Permanent, Other Counting Classes, Gaps