Υπολογιστική Πολυπλοκότητα
Διαθέσιμες Ομιλίες
- Function Problems: The classes coNP and ΔNP, Function classes and reductions, the classes PLS and PPAD.
- Alternation
- Quantum Computation
- Zero-knowledge Proofs
- Pseudorandomness & Derandomization
- Algebraic Computation
- PCPs, Inapproximability, Discrete Fourier Analysis
- Communication Complexity
- Average-Case Complexity
- Zero-Knowledge Proofs
- PSPACE-completeness
- Cryptography and Complexity
Τελευταία τροποποίηση: Monday, 12 December 2016, 3:24 PM