Fields- Symposium on 50 Years of Complexity Theory: A Celebration of the Work of Stephen Cook
-
Title: Computational Complexity in Theory and Practice
Speaker:
Link:
-
Title: Computability and complexity of Julia sets
Speaker:
Link:
-
Title: Complexity, Optimization and Math (or, Can we prove that P != NP by gradient descent?)
Speaker:
Link:
-
Title: NP-Completeness and its Algebraic Siblings
Speaker:
Link:
-
Title: The Tree Evaluation Problem
Speaker:
Link:
-
Title: Can Model Theory Separate NP from co-NP?
Speaker:
Link:
-
Title: Adventures in Complexity
Speaker:
Link:
-
Title: On hierarchies
Speaker:
Link:
-
Title: Propositional proofs and monotone computations
Speaker:
Link:
-
Title: Groups and Individuals in Fairness and Probability (work in progress)
Speaker:
Link:
-
Title: Logical foundations of complexity theory
Speaker:
Link:
-
Title: Algorithms, Proofs, and Communication: A Unified Perspective
Speaker:
Link:
-
Title: Subrecursion, P and NP
Speaker:
Link:
-
Title: P, NP and Proof Complexity
Speaker:
Link:
-
Title: NP-complete Problems and Physics
Speaker:
Link:
-
Title: Factoring and bounded arithmetic
Speaker:
Link:
-
Title: NP and some nice polytopes
Speaker:
Link: