//
sign in
Post
by @danabra.mov
PostEmbed
by @danabra.mov
Record
by @jimpick.com
Record
by @atsui.org
+ new component
Post
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.