|Computer Science/Discrete Mathematics Seminar II|
|Affiliation:||Tel Aviv University; Visiting Professor, School of Mathematics|
|Date:||Tuesday, October 13|
|Time/Room:||10:30am - 12:30pm/S-101|
I will describe several old and new applications of topological and algebraic methods in the derivation of combinatorial results. In all of them the proofs provide no efficient solutions for the corresponding algorithmic problems. Finding such solutions is an intriguing challenge.