Αλγόριθμοι και Πολυπλοκότητα ΙΙ
Διαθέσιμες Ομιλίες
- 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
Last modified: Tuesday, 8 December 2015, 7:16 PM