![School of Mathematics Event](/sites/default/files/styles/two_column_medium/public/2019-09/sm_default.jpg?itok=gMvWynkh)
Computer Science/Discrete Mathematics Seminar I
Lower bounds for clique vs. independent set
We prove an $\omega(\log n)$ lower bound on the conondeterministic communication complexity of the Clique vs. Independent Set problem introduced by Yannakakis (STOC 1988, JCSS 1991). As a corollary, this implies superpolynomial lower bounds for the Alon--Saks--Seymour conjecture in graph theory. Our approach is to first exhibit a query complexity separation for the decision tree analogue of the UP vs. coNP question---namely, unambiguous DNF width vs. CNF width---and then "lift" this separation over to communication complexity using a result from prior work.
Date & Time
February 23, 2015 | 11:15am – 12:15pm
Location
S-101Speakers
Affiliation
University of Toronto