Complexity Theory Courses
IEEE via YouTube Is it Easier to Prove Statements that are Guaranteed to be True?
IEEE via YouTube Extractors and Secret Sharing Against Bounded Collusion Protocols
IEEE via YouTube Nearly Optimal Pseudorandomness From Hardness
IEEE via YouTube Smoothing the Gap Between NP and ER
IEEE via YouTube A Dichotomy for Real Boolean Holant Problems
IEEE via YouTube Characterizing Average-Case Complexity of PH by Worst-Case Meta-Complexity
IEEE via YouTube Efficient Construction of Rigid Matrices Using an NP Oracle
IEEE via YouTube Hardness Magnification for All Sparse NP Languages
IEEE via YouTube The Average-Case Complexity of Counting Cliques in Erdos-Renyi Hypergraphs
IEEE via YouTube