Permalink

Organisatoren

• Swastik Kopparty (University of Toronto, CA)
• Meena Mahajan (The Institute of Mathematical Sciences - Chennai, IN)
• Rahul Santhanam (University of Oxford, GB)
• Amnon Ta-Shma (Tel Aviv University, IL)

Kontakt

• Dagstuhl Service Team

Verwandte Seminare

• Dagstuhl-Seminar 9235: Complexity and Realization of Boolean Functions (1992-08-24 - 1992-08-28) (Details)
• Dagstuhl-Seminar 9711: Complexity of Boolean Functions (1997-03-10 - 1997-03-14) (Details)
• Dagstuhl-Seminar 99441: Complexity of Boolean Functions (1999-10-31 - 1999-11-05) (Details)
• Dagstuhl-Seminar 02121: Complexity of Boolean Functions (2002-03-17 - 2002-03-22) (Details)
• Dagstuhl-Seminar 04141: Complexity of Boolean Functions (2004-03-28 - 2004-04-02) (Details)
• Dagstuhl-Seminar 06111: Complexity of Boolean Functions (2006-03-12 - 2006-03-17) (Details)
• Dagstuhl-Seminar 08381: Computational Complexity of Discrete Problems (2008-09-14 - 2008-09-19) (Details)
• Dagstuhl-Seminar 11121: Computational Complexity of Discrete Problems (2011-03-20 - 2011-03-25) (Details)
• Dagstuhl-Seminar 14121: Computational Complexity of Discrete Problems (2014-03-16 - 2014-03-21) (Details)
• Dagstuhl-Seminar 17121: Computational Complexity of Discrete Problems (2017-03-19 - 2017-03-24) (Details)
• Dagstuhl-Seminar 19121: Computational Complexity of Discrete Problems (2019-03-17 - 2019-03-22) (Details)
• Dagstuhl-Seminar 21121: Computational Complexity of Discrete Problems (2021-03-21 - 2021-03-26) (Details)
• Dagstuhl-Seminar 23111: Computational Complexity of Discrete Problems (2023-03-12 - 2023-03-17) (Details)
• Dagstuhl-Seminar 25111: Computational Complexity of Discrete Problems (2025-03-09 - 2025-03-14) (Details)

Klassifikation

• Computational Complexity

Schlagworte

• computational complexity
• circuit complexity
• communication complexity
• randomness
• lower bounds