CS 254B: Computational Complexity II

Computer Science Stanford University 3.0 credits

Course Description

A continuation of CS254 (Computational Complexity). Topics include Barriers to P versus NP; The relationship between time and space, and time-space tradeoffs for SAT; The hardness versus randomness paradigm; Average-case complexity; Fine-grained complexity; Current and new areas of complexity theory research. Prerequisite: CS254.

Reviews

Sign in to Review Login to Review

No reviews yet. Be the first to share your experience!

Sign in with Google Login to Review