Διαθέσιμες Ομιλίες - Available Presentation Topics
Απαιτήσεις ολοκλήρωσης
- Inapproximability reductions (PCP Theorem and Hardness of Approximations)
[Inapproximability of Combinatorial Optimization Problems (Trevisan)]
- 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]]
- Decision-Tree Complexity
[Complexity measures and decision tree complexity: a survey (H. Buhrman, R. Wolf)]
- Average-Case Complexity
[Ch. 18 from [2]]
- Cryptography and Complexity
[Ch. 9 from [2]]
Τελευταία τροποποίηση: Τρίτη, 23 Νοεμβρίου 2021, 3:16 AM