SOME UNPROVABLE TRUE PROPOSITIONS IN COMPLEXITY

被引:0
|
作者
洪加威 [1 ]
机构
[1] Beijing ComPuter Institute
关键词
SOME UNPROVABLE TRUE PROPOSITIONS IN COMPLEXITY;
D O I
暂无
中图分类号
学科分类号
摘要
In complexity theory, upper bounds have been improved repeatedly, but little has been obtained in the field of lower bounds.For example, the upper bounds for any NP-complete problem are exponential, but there is only a trivial linear lower bound. Thisfaet makes us think that some true propositions in complexity are unprovable. But if we get a result like the G?del’s in-
引用
收藏
页码:1429 / 1429
页数:1
相关论文
共 50 条