On simple and creative sets in NP
- 31 December 1986
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 47, 169-180
- https://doi.org/10.1016/0304-3975(86)90144-1
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Some remarks on witness functions for nonpolynomial and noncomplete sets in NPTheoretical Computer Science, 1985
- Bi-immune sets for complexity classesTheory of Computing Systems, 1985
- Immunity, Relativizations, and NondeterminismSIAM Journal on Computing, 1984
- Oracle-dependent properties of the lattice of NP setsTheoretical Computer Science, 1983
- A note on natural complete sets and Gödel numberingsTheoretical Computer Science, 1982
- Completeness, Approximation and DensitySIAM Journal on Computing, 1981
- On Isomorphisms and Density of $NP$ and Other Complete SetsSIAM Journal on Computing, 1977
- On the Structure of Polynomial Time ReducibilityJournal of the ACM, 1975
- Recursively enumerable sets of positive integers and their decision problemsBulletin of the American Mathematical Society, 1944