[Mittagsseminar TI] Mittagsseminar tomorrow


on

either

1. Finding max. empty convex subsets in R^3 is W[1]-hard

or

2. The complexity of separating points in the plane

You will be able to vote tomorrow on which of the two you'd prefer.

P.