Some Relationship(s) Between Circuit Complexity and Classical Complexity Questions
Speaker: Dylan McKayTitle: Some Relationship(s) Between Circuit Complexity and Classical Complexity Questions
Date: 25 Nov 2019 5:30pm-7:00pm
Location: Maxwell-Dworkin 123
Food: Thai
Abstract: I’ll show an extremely efficient (and simple) algorithm for MCSP and other compression problems, and talk about its consequences. I’ll probably either highlight some related stuff in circuit Complexity, or I’ll just talk about another thing I think is really cool that has similar consequences.