יום רביעי, 14.6.2017, 12:30
חדר 337, בניין טאוב למדעי המחשב
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 procedures for solving the
corresponding algorithmic questions. The problem of finding such
procedures (or convincing reasons indicating that they are unlikely to
exist) is an intriguing challenge.