Back to Talks & Seminars
Talks & Seminars

Ryan O’Donnell|ETH False(CMU 计算复杂性课程第 18 讲)

mjj··0 views

Ryan O’Donnell · Carnegie Mellon University

Graduate Computational Complexity Theory(15-855) · Past · In person

Carnegie Mellon University,Pittsburgh

#1 · Opening post

观看 O’Donnell 课堂录像(YouTube,1:19:45) (opens in a new tab)

活动时间 匹兹堡当地时间 2026-10-29 09:30–10:50。北京时间 2026-10-29 21:30 至 22:50。

这堂课围绕 OpenAI 发布的指数时间假设(ETH)预印本展开。O’Donnell 讲解亚指数时间计算 #3SAT 的总体思路与关键步骤:给定一个 3-CNF 公式,如何数出满足它的赋值。想跟着推导,可以对照讲者整理的讲义。

O’Donnell 配套讲义(PDF) (opens in a new tab) · OpenAI 预印本 (opens in a new tab)

Manage content

. This action is reversible and will be recorded.

Replies

0 public replies

No replies yet.

0 public replies