We are ending with a lovely talk by Tuukka Korhonen who is telling us about lower bounds on tropical circuits, circuits that work over the (max, +) semiring.
The preprint is out!
Bipartite Perfect Matching is in NC, by Abhranil Chatterjee, Sumanta Ghosh, Rohit Gurjar, Roshan Raj, Thomas Thierauf
eccc.weizmann.ac.il/report/2026/...
#MathSky
Nutan Limaye
Next, Magnus Hansen talked about the non-closure of roABPs under factoring. This is in contrast to previous results presented in the session.
Pravesh Kothari is taking us on a tour through the two worlds of algorithms for tensor decomposition.
The first talk in the final session of the final day of the workshop Julian Dörfler is telling us about local combinatorial interpretations. This is like a close cousin of what Igor Pak told us about the first day.
Pietro Posta is telling us how to count interesting representation theoretical quantities using quantum algorithms. Specifically, he provides #BQP algorithms for counting these quantities.
If you know it you know it.
www.kva.se/en/event/cel...
Shanthanu Rai talked about the complexity of a fundamental problem, namely GCD. This is a problem I can explain to my nephew who is in 5th grade. It is fascinating that we have a new upper bound for it since 2024 and it has been made field independent in the work he presented. The talk was online.
Now it's official!! I already finished reading the introduction. Working out the proof is what I'm looking forward to next! Highest on my to-do. eccc.weizmann.ac.il/report/2026/...
Paper number 100. Love it!! :D
