CS Peer Talk | Symmetric Exponential Time Requires…

第三十六期

报告人：Hanlin Ren, University of Oxford

时间：12月26日（星期二）3:00pm

地点：静园五院204

报告信息

Title

Symmetric Exponential Time Requires Near-Maximum Circuit Size

Abstract

We show that there is a language in  (symmetric exponential time) with circuit complexity at least  . In particular, this also implies the same near-maximum circuit lower bounds for the classes  and  . Our proofs relativize. Previously, only “half-exponential” circuit lower bounds for these complexity classes were known, and the smallest complexity class known to require exponential circuit complexity was  (Miltersen, Vinodchandran, and Watanabe COCOON’99).

Our circuit lower bounds are corollaries of an unconditional zero-error pseudodeterministic algorithm with an  oracle (  ) for the range avoidance problem. This algorithm also implies unconditional pseudodeterministic  constructions for Ramsey graphs, rigid matrices, two-source extractors, linear codes, and  -random strings with nearly optimal parameters.

Based on a joint work with Lijie Chen and Shuichi Hirahara and a subsequent improvement by Zeyong Li.

Biography

Hanlin Ren is a third-year DPhil student at the University of Oxford, advised by Prof. Rahul Santhanam. He is interested in computational complexity theory, and his recent works focused on circuit complexity and pseudorandomness. Prior to that, he was an undergraduate student at Tsinghua University and worked on graph algorithms with Prof. Ran Duan.

about CS Peer Talk

作为活动的发起人，我们来自北京大学图灵班科研活动委员会，主要由图灵班各年级同学组成。我们希望搭建一个CS同学交流的平台，促进同学间的交流合作，帮助同学练习展示，同时增进友谊。

目前在计划中的系列包括但不限于：

• 教程系列：学生讲者为主，介绍自己的研究领域

• 研究系列：学生讲者为主，介绍自己的研究成果

• 客座系列：邀请老师做主题报告

除非报告人特别要求，报告默认是非公开的，希望营造一个自由放松但又互相激励的交流氛围。

主讲嘉宾招募

如果你愿意和大家分享你的学术成果、经历经验，总结回顾、触发新思，欢迎报名自荐。

主讲人报名：发邮件至 cs_research_tc@163.com，写明想讲的题目、内容及时间。

北京大学图灵班科研活动委员会

—   版权声明  —

本微信公众号所有内容，由北京大学前沿计算研究中心微信自身创作、收集的文字、图片和音视频资料，版权属北京大学前沿计算研究中心微信所有；从公开渠道收集、整理及授权转载的文字、图片和音视频资料，版权属原作者。本公众号内容原作者如不愿意在本号刊登内容，请及时通知本号，予以删除。