l 报告时间：
3:00pm - 4:30pm, Sept. 13, 2007, Thursday
1:00pm - 2:30pm, Sept. 14, 2007, Friday
l 内容简介：
These lectures will be centered around a set of questions that can be loosely described as follows:
Are major open problems in Complexity Theory like $NP\stackrel?\subseteq P/poly$ or $P\stackrel ?\subseteq NC1/poly$ independent from systems of Bounded Arithmetic? Do they possess efficient propositional proofs?
|
