College of Engineering >
Computer Science >
Computer Science Technical Reports >
Please use this identifier to cite or link to this item:
|Title: ||On Census Complexity and Sparseness of NP Complete Sets|
|Authors: ||Hartmanis, Juris|
Mahaney, Stephen R.
|Keywords: ||computer science|
|Issue Date: ||Apr-1980|
|Publisher: ||Cornell University|
|Abstract: ||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.|
|Appears in Collections:||Computer Science Technical Reports|
Items in eCommons are protected by copyright, with all rights reserved, unless otherwise indicated.