Exploring Compsci 172 - Computability and Complexity

In Major in Computer Science (UC Berkeley)

Order

Category

Notes
8
All
Notes
category

Categories

library_books

All the files in #2nd Compsci 172 - Computability and Complexity

apuntes

-

Zero-Knowledge.pdf

apuntes

-

Kolmogorov-Complexity.pdf

apuntes

-

PCP-theorem.pdf

apuntes

-

Unprovable-Statements.pdf

apuntes

-

NP-Completeness.pdf

apuntes

-

Hierarchy-Theorems.pdf

apuntes

-

RICE-theorem.pdf

apuntes

-

Space-Bounded-Complexity.pdf