On Census Complexity and Sparseness of NP Complete Sets
On Census Complexity and Sparseness of NP Complete Sets（1980）
摘要
In this note we show that if there are sparse NP complete sets with a polynomial time computable census function then $P=NP$. We also derive related results about the complexity of the census function for context-sensitive languages and $\log n$-tape bounded languages.
更多查看译文
关键词
np complete sets,sparse np complete set,tape bounded language,polynomial time computable census,census complexity,census function,derive related result,log n,context-sensitive language,computer science,technical report
AI 理解论文
溯源树
样例
生成溯源树，研究论文发展脉络
Chat Paper
正在生成论文摘要