On sparse sets in NP-P
type: Item
instance of: scholarly article
title: On sparse sets in NP-P
zbMATH Open document ID: 0501.68014
DOI: 10.1016/0020-0190(83)90024-8
published in: Information Processing Letters
publication date: 1983-01-01T00:00:00Z
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 3789828
zbMATH Keywords: deterministic and nondeterministic computations
zbMATH Keywords: exptime
zbMATH Keywords: nexptime
zbMATH Keywords: expspace
author: J. Hartmanis
MaRDI profile type: Publication
full work available at URL: 0020-0190(83)90024-8
OpenAlex ID: W2069348040
cites work: On Isomorphisms and Density of $NP$ and Other Complete Sets
cites work: Tally languages and complexity classes
cites work: Inclusion complete tally languages and the Hartmanis-Berman conjecture
cites work: Q4198056
cites work: On the Structure of Polynomial Time Reducibility
description: scientific article; zbMATH DE number 3789828