eCommons

 

On Census Complexity and Sparseness of NP Complete Sets

Other Titles

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 logn-tape bounded languages.

Journal / Series

Volume & Issue

Description

Sponsorship

Date Issued

1980-04

Publisher

Cornell University

Keywords

computer science; technical report

Location

Effective Date

Expiration Date

Sector

Employer

Union

Union Local

NAICS

Number of Workers

Committee Chair

Committee Co-Chair

Committee Member

Degree Discipline

Degree Name

Degree Level

Related Version

Related DOI

Related To

Related Part

Based on Related Item

Has Other Format(s)

Part of Related Item

Related To

Related Publication(s)

Link(s) to Related Publication(s)

References

Link(s) to Reference(s)

Previously Published As

http://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR80-416

Government Document

ISBN

ISMN

ISSN

Other Identifiers

Rights

Rights URI

Types

technical report

Accessibility Feature

Accessibility Hazard

Accessibility Summary

Link(s) to Catalog Record