Problem Solving Track | Computational Complexity
Opening technical session for the "Problem Solving Track", taking place this Saturday, November 27th, from 8:00 - 8:45 pm (GMT+02).
Computational complexity is very important in the analysis of algorithms. As problems become more complex and increase in size, it is important to be able to select algorithms for efficiency and solvability.
Join us on Google Meet using the following links:
Video call link: meet.google.com/pqf-psxn-azm
***Essential programming skills are preferable.
Stay Tuned !! ✨
Follow us on Facebook:
Follow us on Twitter:
Follow us on Instagram:
Join our chapter: