Mathematical Sciences Department Discrete Math Seminar Mason Dicicco, WPI "Communication Complexity and Linear Arrangements" (Olin Hall 109)
![Mason Dicicco Flier - Olin Hall 109 at 12 PM, Friday March 22nd, 2024](/sites/default/files/styles/1x_1000x576/public/2024-03/Mason-Dicicco-3-22-24_2.jpg?itok=FW_faQ_6)
Friday, March 22, 2024
12:00 pm
12:00 pm
Location
Floor/Room #
Floor 1, Room 109
Title: Communication Complexity and Linear Arrangements
Abstract: A communication protocol is an algorithm for two parties to compute a shared (Boolean) function when the input is split between them. Today I will prove a theorem of Forster et al., that randomized, unbounded error communication protocols have the exact same expressive capabilities as linear arrangements -- a method of encoding functions by intersections of homogeneous half-spaces.
Friday, March 22nd, 2024
12:00PM - 12:50 PM
Olin Hall 109
Audience(s)