Mathematical Sciences Department Discrete Math Seminar - Mason Dicicco, WPI "Communication Complexity and Linear Arrangements" (OH 109)

A poster for Mason Dicicco’s upcoming talk on March 22nd, 2024 in Olin Hall 109, at 12:00 PM. 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.
Friday, March 22, 2024
12:00 p.m. to 1:00 p.m.
Location
Olin Hall
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:00 AM-12:50 AM

Olin Hall Room 109

Add to Google Calendar Add to Calendar
Audience(s)
Alumni Current Students Faculty

DEPARTMENT(S):

Mathematical Sciences