## Study notes with most views in computational methods

# Computational Complexity PCP Theorem and Final Thoughts, Lecture Notes - Computer Science

Prof. Salil Vadhan, Computer Science, Computational Complexity, The PCP Theorem and Final Thoughts, NP = PCP(log,O(1)), Rubinﬁeld-Sudan, Harvard, Lecture Notes

# Computational Complexity Circuit Depth, Lecture Notes - Computer Science

Prof. Salil Vadhan, Computer Science, Computational Complexity, Uniform Circuits, Circuit Depth, Simultaneous Size and Depth Bounds, Borodin, Harvard, Lecture Notes

# Computational Complexity Arthur-Merlin Games, Lecture Notes - Computer Science

Prof. Salil Vadhan, Computer Science, Computational Complexity, Arthur-Merlin Games, Harvard, Lecture Notes