eCommons

 

Sparse Complete Sets for NP: Solution of a Conjecture by Berman and Hartmanis

Other Titles

Abstract

In this paper we show that if NP has a sparse complete set under many-one reductions, then P=NP. The result is extended to show that if NP is sparse reducible, then P=NP. The main techniques of this paper generalize the NP recognizer for the complement of a sparse complete set with census function to the case where the census function is not known (c.f. [HM]), then a many-one reduction of this language to the sparse set permits a polynomial time bounded tree search as in [B], [F], or [MP]. Even without actual knowledge of the census, the algorithm utilizes the properties of the true census to decide membership in SAT in polynomial time.

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-417

Government Document

ISBN

ISMN

ISSN

Other Identifiers

Rights

Rights URI

Types

technical report

Accessibility Feature

Accessibility Hazard

Accessibility Summary

Link(s) to Catalog Record