Combinatorial Problems and Algorithmic Complexity

Details
In his talk, Angelo will explore how to recognise combinatorial problems and discuss strategies for finding suitable solutions efficiently, grounded in an understanding of algorithmic complexity. Buckle up, fire up your brains and join us for the talk (and cool down afterwards)!

What to expect
Some problems are extremely difficult to solve because of the sheer number of possible solutions.

How can we identify such problems, and what strategies can we employ to find acceptable solutions within a reasonable amount of time?

This talk explores how to recognise such combinatorial problems and discusses strategies for finding suitable solutions efficiently, grounded in an understanding of algorithmic complexity.

Who is it for?
This session is perfect for developers, architects, academics and anyone interested in algorithms and complexity. If big O is something you live for, this talk is definitely for you.

This talk will be grounded in scientific theory, and there will be focus on more traditional computer science topics. Forget about IDEs for a bit, but let's talk about algorithms, pseudocode, and solution spaces.

About the speaker
Angelo Groot is a Software Engineer at Flock., previously associated with the University of Amsterdam, a dedicated mathematician and developer, specializing in AI. [ LinkedIn profile Angelo Groot ]

Agenda:
15:45 walk in for the talk
16:00 talk
17:00 drinks & networking

Bring your questions and enthusiasm—we’ll have time for Q&A and discussions after the talk!

RSVP now to reserve your spot. Let’s code, learn, and grow together!