Barbados Complexity Workshop 2026
Barbados Complexity Workshop returns in 2026 as a reincarnation of the McGill Invitational Workshop on Computational Complexity.
Tentative schedule
The lectures start in the morning of Sunday, April 5th, and go till the evening of Thursday, April 9th, with free afternoon/evening on Wednesday. The first (2-hour) lecture of the day is from breakfast to lunch (with a break), and the second starts after the dinner. Breakfasts and dinners are at Bellairs, lunches in town.
The tentative list of topics is
- Day 1, Sun Apr 5: Introduction to algebraic complexity through some upper bounds and structure results. Driving towards the theme Structure ==> Lower bounds.
- Day 2, Mon Apr 6: Lower bound techniques and results (including unconditional lower bounds for different models such as circuits, ABPs, constant depth circuits).
- Day 3, Tue Apr 7: Hardness vs. randomness, KI generator and connection to factoring, bootstrapping, factor closure results.
- Day 4, Wed Apr 8: Algebraic proof complexity
- Day 5, Thu Apr 9: Natural proofs, barrier results, PIT for special cases and connections, a friendly introduction to GCT and new questions in algebraic complexity.
Practical information (by Denis Therien, 2018)
In particular, for taxi from the airport they recommend Prince Butcher, which can be reached at (246) 263-2006 or email: ptservices246@gmail.com.
If you have any questions, please contact the organizers Robert Robere, Hamed Hatami , and Antonina Kolokolova.