Υπολογιστική Πολυπλοκότητα
Διαθέσιμες Ομιλίες - Available Presentation Topics
- Function Problems: The classes coNP and ΔNP, Function classes and reductions, the classes PLS and PPAD.
[Chapter 10 from [1], David S. Johnson, The NP-completeness column: Finding needles in haystacks (2007)] - Inapproximability reductions
- Alternation
[Ch.5 from [2]] - Quantum Computation
[Ch. 10 from [2]] - Zero-knowledge Proofs
[O. Goldreich, Zero-Knowledge, 2002] - Algebraic Computation
[Ch. 16 from [2]] - Communication Complexity
[Ch. 13 from [2]] - Average-Case Complexity
[Ch. 18 from [2] - PSPACE-completeness
[Ch. 19 from [1]] - Cryptography and Complexity
[Ch. 9 from [2]
Τελευταία τροποποίηση: Thursday, 28 November 2019, 11:17 PM