On Census Complexity and Sparseness of NP Complete Sets

Thumbnail
View/Open
PERMANENT LINK(S)
https://hdl.handle.net/1813/6256
Collections
Metadata
Show full item record
Author
Hartmanis, Juris; Mahaney, Stephen R.
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.
Date Issued
1980-04
Publisher
Cornell University
Subject
computer science; technical report
Previously Published As
http://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR80-416
Type
technical report

Statistics