NP-hard sets are superterse unless NP is small

Wang, Yongge

doi:10.1016/S0020-0190(96)00189-5

Local TagsRelease HistoryDetailsSummary

NP-hard sets are superterse unless NP is small

Wang, Y. (1997). NP-hard sets are superterse unless NP is small. Information Processing Letters, 61(1), 1-6. doi:10.1016/S0020-0190(96)00189-5.

Item is Released

show all hide all

Basic

show hide

Item Permalink: https://hdl.handle.net/11858/00-001M-0000-000F-39ED-B Version Permalink: https://hdl.handle.net/21.11116/0000-000E-2953-7

Genre: Journal Article

Files

show Files

Locators

show

Creators

show

hide

Creators:
Wang, Yongge¹, Author

Affiliations:
1Programming Logics, MPI for Informatics, Max Planck Society, ou_40045

Content

show

Details

show

hide

Language(s): eng - English

Dates: Modified: 2010-03-12Date issued: 1997

Publication Status: Issued

Pages: -

Publishing info: -

Table of Contents: -

Rev. Type: Peer

Identifiers: eDoc: 519596
Other: Local-ID: C1256104005ECAFC-B67B9E3ABEC305CEC125649D0044F36E-WangIPL96a
DOI: 10.1016/S0020-0190(96)00189-5
BibTex Citekey: Wang_IPL97

Degree: -

Event

show

Legal Case

show

Project information

show

Source 1

show

hide

Title: Information Processing Letters

Source Genre: Journal

Creator(s):

Affiliations:

Publ. Info: Amsterdam : Elsevier

Pages: - Volume / Issue: 61 (1) Sequence Number: - Start / End Page: 1 - 6 Identifier: ISSN: 0020-0190