Oxford-Warwick Complexity Meetings

External homepage

computational complexity discrete mathematics logic in computer science combinatorics logic

University of Oxford / University of Warwick

Audience: Researchers in the topic
Seminar series times: No fixed schedule
Organizers: Igor Oliveira*, Rahul Santhanam
*contact for this listing

Oxford-Warwick Complexity Meetings - Please check www.dcs.warwick.ac.uk/~igorcarb/complexity-meetings.html for Zoom link and schedule

Upcoming talks
Past talks
Your timeSpeakerTitle
ThuApr 2212:00Hanlin RenHardness of KT characterizes parallel cryptography
Embed this schedule
Your timeSpeakerTitle
ThuApr 0816:00Josh AlmanKronecker products, low-depth circuits, and matrix rigidity
FriMar 2617:00Avishay TalPseudorandom generators for read-once monotone branching programs
ThuMar 1115:00Yuval FilmusBounded indistinguishability for simple sources
ThuFeb 2517:00Robert RobereAmortized circuit complexity, formal complexity measures, and catalytic algorithms
FriFeb 1216:00Susanna F. de RezendeAutomating tree-like resolution in time n^o(log n) is ETH-hard
ThuJan 2817:00Alexandros HollenderThe complexity of gradient descent: CLS = PPAD ∩ PLS
ThuJan 1417:00Eric AllenderCryptographic Hardness under Projections for Time-Bounded Kolmogorov Complexity
ThuDec 0317:00Toniann PitassiLifting with Sunflowers
ThuNov 1217:00Roei TellSimple and fast derandomization from very hard functions - Eliminating randomness at almost no cost
ThuOct 2917:00Ryan WilliamsAlmost-everywhere circuit lower bounds from non-trivial derandomization
ThuOct 1516:00Christian IkenmeyerRecent progress on Geometric Complexity Theory
ThuOct 0116:00Rafael PassOn one-way functions and Kolmogorov complexity
ThuSep 1712:00Shuichi HiraharaMeta-complexity theoretic approach to complexity theory
ThuAug 2016:00Srikanth SrinivasanA robust version of Heged\H{u}s's lemma
ThuAug 0616:00Mrinal KumarOn the existence of algebraically natural proofs
ThuJul 2316:00Benjamin RossmanSize-depth tradeoff for multiplying k permutations
ThuJul 1616:00Lijie ChenSharp threshold results for computational complexity
ThuJul 0216:00Or MeirThe KRW Conjecture: Past, present, and future
ThuJun 1816:00Rahul IlangoA lifting-esque theorem for constant depth formulas with consequences for MCSP and lower bounds
Embed this schedule
Export series to