eCommons

 

On Sparse Sets in NP-P

Other Titles

Abstract

The main result of this note shows that there exist sparse sets in NP that are not in P if and only if NEXPTIME differs from EXPTIME. Several other results are derived about the complexity of very sparse sets in NPP and an interpretation of the meaning of these results is given in terms of the complexity of solving "individual instances" of problems in NPP.

Journal / Series

Volume & Issue

Description

Sponsorship

Date Issued

1982-08

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/TR82-508

Government Document

ISBN

ISMN

ISSN

Other Identifiers

Rights

Rights URI

Types

technical report

Accessibility Feature

Accessibility Hazard

Accessibility Summary

Link(s) to Catalog Record